{"id":"W793576242","doi":"10.1007/978-3-319-18008-3_16","title":"Combining Constraint Propagation and Discrete Ellipsoid-Based Search to Solve the Exact Quadratic Knapsack Problem","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Knapsack problem; Solver; Ellipsoid; Mathematical optimization; Computer science; Quadratic programming; Extension (predicate logic); Quadratic growth; Optimization problem; Second-order cone programming; Constraint (computer-aided design); Regular polygon; Convex optimization; Mathematics; Algorithm","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.0008639441,0.0002950421,0.0002559128,0.000272638,0.0001570548,0.0003589237,0.0004219927,0.0001440388,0.00002066882],"category_scores_gemma":[0.00003648679,0.0002189184,0.00003360751,0.0002738227,0.0004387908,0.0001214959,0.0001228405,0.0005325741,0.00001861376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001502745,"about_ca_system_score_gemma":0.0002498681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009484358,"about_ca_topic_score_gemma":0.00005125225,"domain_scores_codex":[0.9983891,0.00002226136,0.0002967298,0.0004493622,0.0004996082,0.0003429526],"domain_scores_gemma":[0.9990419,0.0002317347,0.00005832841,0.0003626251,0.0001580228,0.0001474536],"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.000002907166,0.000003032823,0.00001143048,0.00007921101,0.000005813172,0.000003344926,0.001239584,0.942834,0.00008260823,0.001954247,0.00002579131,0.05375802],"study_design_scores_gemma":[0.0001973717,0.000115065,0.00000993463,0.0004752713,0.000007202282,0.00001171196,0.000001242996,0.9914337,0.0004922964,0.006389669,0.0005514933,0.00031509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001037963,0.0001640656,0.9940236,0.000787469,0.0003365625,0.0007643925,0.000006364103,0.0001339281,0.003679845],"genre_scores_gemma":[0.7786283,0.0000236731,0.2202153,0.0006513842,0.0001880421,0.0000266221,0.00002668151,0.00007904819,0.0001609755],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7785245,"threshold_uncertainty_score":0.8927234,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02724005084198257,"score_gpt":0.251362261037277,"score_spread":0.2241222101952944,"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."}}