{"id":"W1965523840","doi":"10.1007/s10732-007-9021-7","title":"Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming","year":2007,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":62,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"National Science Foundation","keywords":"Intersection (aeronautics); Integer programming; Convexity; Heuristic; Integer (computer science); Mathematical optimization; Linear programming; Software; Computer science; Mathematics; Function (biology); Algorithm; Programming language","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.001532537,0.0001540312,0.0003511905,0.0002400796,0.000128048,0.00006545747,0.0001877297,0.00008548622,0.00001618033],"category_scores_gemma":[0.00725344,0.0001277858,0.00009778499,0.0001948895,0.0001163321,0.0001272249,0.00007407343,0.00035826,0.000001871958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008780206,"about_ca_system_score_gemma":0.00007844516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.495773e-7,"about_ca_topic_score_gemma":0.000005728346,"domain_scores_codex":[0.9982325,0.0000427229,0.0007711756,0.0001352721,0.0004481557,0.0003701043],"domain_scores_gemma":[0.9961174,0.001985945,0.0005069796,0.0001533394,0.00100641,0.0002299714],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004617183,0.004732873,0.007360408,0.005326252,0.001630413,0.002849807,0.008662695,0.002653894,0.001199152,0.1628124,0.1105971,0.6875578],"study_design_scores_gemma":[0.01664748,0.005751271,0.002037618,0.001457624,0.001168932,0.004603512,0.00717671,0.09180707,0.005537021,0.5702987,0.2912451,0.002268991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006391054,0.0003146431,0.9922851,0.0001747683,0.0003165479,0.0003234788,0.00001169089,0.00002263613,0.0001600725],"genre_scores_gemma":[0.1103338,0.0001390999,0.8882363,0.00004871054,0.0004655911,0.000005820544,0.00000256897,0.00005766206,0.0007104848],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6852888,"threshold_uncertainty_score":0.8683569,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05059042372315479,"score_gpt":0.4014260918634955,"score_spread":0.3508356681403407,"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."}}