{"id":"W2470076424","doi":"10.1016/j.cor.2016.07.005","title":"The boolean quadratic programming problem with generalized upper bound constraints","year":2016,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Upper and lower bounds; Quadratic programming; Quadratic assignment problem; Quadratic equation; Mathematics; Mathematical optimization; Computer science; Metaheuristic; Computational complexity theory; Sequential quadratic programming; Theoretical computer science; Combinatorial optimization; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002133891,0.0009988825,0.001673341,0.0007330896,0.0005792199,0.002508972,0.001968853,0.001676211,0.008768264],"category_scores_gemma":[0.009625962,0.00058161,0.0007539885,0.002326639,0.001197728,0.003471764,0.001549195,0.002707793,0.0009655585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001683913,"about_ca_system_score_gemma":0.002028145,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005551904,"about_ca_topic_score_gemma":0.00444576,"domain_scores_codex":[0.997719,0.0009684264,0.00006910627,0.0003904339,0.0005258697,0.0003271535],"domain_scores_gemma":[0.9966054,0.002427645,0.0002326929,0.0001944418,0.0003694728,0.0001703111],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004167292,0.0002298618,0.0006501878,0.000814549,0.00009402294,0.0003670791,0.0001114999,0.475765,0.003366128,0.3629176,0.02762049,0.1276469],"study_design_scores_gemma":[0.00009868074,0.00007753543,0.0002818124,0.00004728355,0.00003076388,0.0001189058,0.00004828673,0.8029884,0.0008223509,0.188884,0.006576286,0.00002567925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02685847,0.00181715,0.9425595,0.003534764,0.0003788157,0.0001226676,0.001045662,0.0003086504,0.0233743],"genre_scores_gemma":[0.6117848,0.003499978,0.3536224,0.001245096,0.0009016112,0.0004302179,0.002251592,0.0004366904,0.02582759],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008768264,"threshold_uncertainty_score":0.02933276,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03091857895817373,"score_gpt":0.3029208117118912,"score_spread":0.2720022327537174,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}