{"id":"W1605874004","doi":"10.1002/9780470400531.eorms0118","title":"Branch‐Price‐and‐Cut Algorithms","year":2011,"lang":"en","type":"other","venue":"Wiley Encyclopedia of Operations Research and Management Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":89,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"","keywords":"Column generation; Branch and cut; Linear programming relaxation; Discretization; Branch and bound; Branch and price; Integer programming; Relaxation (psychology); Branching (polymer chemistry); Integer (computer science); Cutting-plane method; Mathematics; Tree (set theory); Polyhedron; Column (typography); Mathematical optimization; Algorithm; Decomposition; Computer science; Combinatorics; Geometry","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.00128585,0.0001661027,0.0001900636,0.001111544,0.0002312718,0.0001182395,0.0004316167,0.00008379415,0.0004831652],"category_scores_gemma":[0.00009098338,0.0001604141,0.00001572671,0.00104419,0.0008134784,0.0002211086,0.0003301107,0.0002160156,0.00003591501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000344399,"about_ca_system_score_gemma":0.00004966521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001411683,"about_ca_topic_score_gemma":0.00007821556,"domain_scores_codex":[0.9983052,0.00005492639,0.0002193238,0.0004070775,0.0005930342,0.000420454],"domain_scores_gemma":[0.9992582,0.00003613036,0.00002046319,0.0003988191,0.0001078314,0.0001785714],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001132529,0.0002599813,0.0006335792,0.002690778,0.0002753354,0.00003236281,0.002259246,0.0127303,0.0005059223,0.06541675,0.4630406,0.4521438],"study_design_scores_gemma":[0.0006669151,0.0001806698,0.001334075,0.0008192886,0.00004104226,0.000008721132,0.0002485561,0.1367599,0.000267181,0.0007056823,0.8581767,0.0007912333],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0001144092,0.001456593,0.05287723,0.0000364705,0.0002392194,0.0006747317,0.00001889005,0.000165404,0.9444171],"genre_scores_gemma":[0.0009758078,0.1477832,0.3470596,0.00002021874,0.0001716924,0.000185577,0.00001650335,0.0002196627,0.5035678],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.4513526,"threshold_uncertainty_score":0.6541497,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03414338929212809,"score_gpt":0.3253230592812753,"score_spread":0.2911796699891472,"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."}}