{"id":"W1972168423","doi":"10.3934/jimo.2008.4.125","title":"Canonical dual approach to solving 0-1 quadratic programming problems","year":2008,"lang":"en","type":"article","venue":"Journal of Industrial and Management Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Dual polyhedron; Duality gap; Dual (grammatical number); Duality (order theory); Convexity; Mathematics; Canonical transformation; Quadratic programming; Convex analysis; Strong duality; Canonical form; Mathematical optimization; Wolfe duality; Perturbation function; Minification; Linear programming; Transformation (genetics); Convex optimization; Regular polygon; Weak duality; Optimization problem; Combinatorics; Pure mathematics","routes":{"ca_aff":true,"ca_fund":false,"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.0004679611,0.000107221,0.0001929124,0.0003344615,0.0001968267,0.0001801331,0.0002261106,0.00006119646,0.000008679503],"category_scores_gemma":[0.00006505828,0.00008833646,0.00006191627,0.0007580506,0.00001943941,0.0006274261,0.0001315296,0.0001202686,0.000001449978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004945687,"about_ca_system_score_gemma":0.00007254021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008232802,"about_ca_topic_score_gemma":8.215861e-7,"domain_scores_codex":[0.9986934,0.00006810576,0.0004961014,0.0001820174,0.0004068054,0.0001535839],"domain_scores_gemma":[0.9992126,0.00002677916,0.0003007809,0.0001150923,0.0002036086,0.0001411906],"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.0000148515,0.0001620721,0.0002856895,0.00001188215,0.00009476121,0.00001024216,0.0004650588,0.9753165,0.000002760181,0.01468713,0.001378,0.007571016],"study_design_scores_gemma":[0.001517513,0.0002301562,0.0002520427,0.00006426351,0.00008438945,0.0001293434,0.0001146665,0.9926881,0.000009788727,0.0001258745,0.00457211,0.0002118213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006941997,0.00003138796,0.9958247,0.001434345,0.0001945658,0.0002696392,3.340658e-7,0.00002416397,0.001526697],"genre_scores_gemma":[0.08390217,0.0002767167,0.9146855,0.000305786,0.0002930425,0.00001464562,0.000006981644,0.000009356129,0.0005057539],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.08320798,"threshold_uncertainty_score":0.3602256,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05270550080112391,"score_gpt":0.2373011241684848,"score_spread":0.1845956233673609,"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."}}