{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006372488,0.0001275857,0.0001092073,0.0001260146,0.000864685,0.0006945365,0.0002942056,0.00004961105,0.00005367991],"category_scores_gemma":[0.00005149622,0.00006864069,0.00003056137,0.000404654,0.0004345155,0.0001834206,0.00004896438,0.000210935,0.0001013277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000101978,"about_ca_system_score_gemma":0.0001357113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001503523,"about_ca_topic_score_gemma":0.00008861512,"domain_scores_codex":[0.9985693,0.0001482348,0.000218124,0.0002124978,0.000389441,0.000462368],"domain_scores_gemma":[0.9989573,0.0002425977,0.000008059668,0.0003288726,0.0003361853,0.000126958],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003396539,0.0000735225,0.0002577557,0.00003806316,0.0001968802,0.00001744471,0.001463372,0.5146523,0.001482558,0.01569762,0.003959525,0.462127],"study_design_scores_gemma":[0.001187541,0.0001392209,0.0001232084,0.0001707632,0.00000832077,0.00003463962,0.0003969541,0.9848306,0.001281853,0.0001258133,0.0114127,0.0002883909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04465789,0.0003127961,0.9494165,0.003003213,0.0002637466,0.0008645538,0.000005406886,0.0003840106,0.001091926],"genre_scores_gemma":[0.4982997,0.0001731365,0.4988511,0.00005725288,0.0002449283,0.0003474024,0.00001804025,0.00006724765,0.001941237],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4701783,"threshold_uncertainty_score":0.6697432,"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."}}