{"id":"W2279368206","doi":"10.1007/978-3-319-07046-9_24","title":"Combining Discrete Ellipsoid-Based Search and Branch-and-Cut for Binary Quadratic Programming Problems","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Benchmark (surveying); Computer science; Quadratic programming; Solver; Binary number; Ellipsoid; Algorithm; Mathematical optimization; Local search (optimization); Theoretical computer science; 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.002486187,0.00133219,0.002441648,0.001634086,0.0005035397,0.00162255,0.002457317,0.001631418,0.005801487],"category_scores_gemma":[0.006357438,0.0009399967,0.0009984329,0.003409505,0.0008237275,0.002549254,0.002490324,0.00294587,0.00111264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009678403,"about_ca_system_score_gemma":0.001226422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002874997,"about_ca_topic_score_gemma":0.003554888,"domain_scores_codex":[0.9984818,0.0005559055,0.00006705138,0.0001639354,0.0006409951,0.00009038493],"domain_scores_gemma":[0.9980028,0.001393444,0.00007738223,0.000183061,0.0002593067,0.00008401877],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002267779,0.00029322,0.0002612464,0.0003028354,0.00008283668,0.00003466655,0.00007023509,0.635286,0.002269664,0.04594747,0.008243669,0.3069814],"study_design_scores_gemma":[0.00001894535,0.00002397016,0.00003376562,0.00001148164,0.000006773635,0.000008979797,0.000003738752,0.9873744,0.000195958,0.01165891,0.000658661,0.000004374088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005165975,0.0007409641,0.9880753,0.0001586341,0.00009785699,0.00004905382,0.00003973595,0.0003819779,0.005290576],"genre_scores_gemma":[0.1783275,0.0008462439,0.8148085,0.0002823767,0.000179637,0.0002359071,0.0002650708,0.000357967,0.004696722],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005801487,"threshold_uncertainty_score":0.01940793,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04543699773441875,"score_gpt":0.3313807502397554,"score_spread":0.2859437525053367,"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."}}