{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001085051,0.001432367,0.001595681,0.001226405,0.0004576951,0.001247136,0.002110239,0.001499758,0.005989668],"category_scores_gemma":[0.003831177,0.0009647696,0.0009015425,0.00302621,0.0007733149,0.002191406,0.002033045,0.002435788,0.001337036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005978474,"about_ca_system_score_gemma":0.00132335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007262207,"about_ca_topic_score_gemma":0.008207702,"domain_scores_codex":[0.9992303,0.0001565532,0.00004055105,0.0001059075,0.0004039741,0.00006279687],"domain_scores_gemma":[0.9987844,0.0007526632,0.0000581006,0.0001162561,0.0002414145,0.00004717855],"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.00007335687,0.0001573819,0.0001388335,0.0001938056,0.00004300608,0.00003668079,0.00004666966,0.8065811,0.002553145,0.01959176,0.004734363,0.1658498],"study_design_scores_gemma":[0.000008991666,0.00001126932,0.00001560963,0.000007009753,0.000003019135,0.000007121193,0.000003300155,0.9958514,0.0002386067,0.003364284,0.0004851579,0.000004252084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002485283,0.000208711,0.992589,0.00007232298,0.0000717666,0.00003807125,0.00003452698,0.0002797255,0.004220559],"genre_scores_gemma":[0.09651283,0.0003726548,0.8978636,0.0002186959,0.0000812183,0.0001993592,0.0002441787,0.0003025871,0.004204876],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007262207,"threshold_uncertainty_score":0.02003747,"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."}}