{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001531822,0.001130847,0.0006557847,0.0008589873,0.000616899,0.00160231,0.0009282743,0.0008078018,0.00539881],"category_scores_gemma":[0.00209024,0.0004422478,0.0009338408,0.0008421551,0.001577581,0.001449958,0.002093993,0.002473206,0.001242392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007885637,"about_ca_system_score_gemma":0.001656921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001400896,"about_ca_topic_score_gemma":0.001801081,"domain_scores_codex":[0.9991286,0.0004653875,0.00002276395,0.00009402795,0.0002093627,0.00007978093],"domain_scores_gemma":[0.9996333,0.0001237229,0.00002880119,0.0000378669,0.0001367529,0.00003946816],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002270194,0.0000550614,0.0001837101,0.00008286231,0.00001987053,0.00005424349,0.00008957322,0.09324308,0.001063622,0.8759496,0.003203224,0.0260325],"study_design_scores_gemma":[0.00001815602,0.00006025142,0.00006731449,0.00002281953,0.000008579913,0.00007265913,0.00004596074,0.6865814,0.0009487164,0.3039422,0.00821633,0.00001566398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003546628,0.0003107673,0.9832377,0.0002610629,0.0001053605,0.00003399515,0.00003189889,0.00006132685,0.01241122],"genre_scores_gemma":[0.2606926,0.001993429,0.7108202,0.0004094327,0.000494766,0.0004922521,0.0002215086,0.0002101812,0.02466561],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00539881,"threshold_uncertainty_score":0.0180608,"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."}}