{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001366904,0.0003996658,0.0005418874,0.0005490278,0.0003846518,0.0003491312,0.000539933,0.0002301642,0.000008198178],"category_scores_gemma":[0.0004287197,0.000350154,0.00006528948,0.0002763549,0.001093056,0.0001702436,0.0004126507,0.0006480087,0.00000232415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000121911,"about_ca_system_score_gemma":0.0002712803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000606747,"about_ca_topic_score_gemma":0.00004187502,"domain_scores_codex":[0.9971346,0.00005407869,0.0004528284,0.0009778821,0.0007460404,0.0006345731],"domain_scores_gemma":[0.9966031,0.00223577,0.0001635456,0.0005165573,0.0002919053,0.0001890693],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003443384,0.00003933794,0.00005486489,0.001715825,0.00002176797,0.00001163832,0.001253024,0.2414149,0.0001240957,0.0146167,0.000006547357,0.7407069],"study_design_scores_gemma":[0.0005778475,0.0004309105,0.000003705765,0.0007543355,0.00001162171,0.00001387168,6.954826e-7,0.8596634,0.0002945369,0.1375929,0.0002834255,0.0003727303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002139286,0.0002051188,0.9969257,0.0005991956,0.0001437125,0.001688423,0.000007109087,0.00009691812,0.0001198698],"genre_scores_gemma":[0.04449499,0.00003618622,0.9544181,0.0001939287,0.0001573511,0.00008096426,0.00001618267,0.0000915899,0.0005106776],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7403342,"threshold_uncertainty_score":0.999895,"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."}}