{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001896661,0.001475642,0.001679674,0.001132914,0.0007315333,0.002309978,0.001856433,0.001875522,0.01614548],"category_scores_gemma":[0.004794223,0.0007570678,0.0009120191,0.002561642,0.0011779,0.002507678,0.00162763,0.003239552,0.003219608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001444446,"about_ca_system_score_gemma":0.001551206,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003043511,"about_ca_topic_score_gemma":0.003197949,"domain_scores_codex":[0.9985127,0.000691471,0.00006736535,0.0001944164,0.0003731026,0.0001609761],"domain_scores_gemma":[0.9977963,0.001588045,0.0001360699,0.0001917104,0.0002150944,0.00007287512],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001165894,0.0001691819,0.0003334817,0.0002677009,0.00009174057,0.00009537154,0.00006915293,0.6116681,0.0009087533,0.1595635,0.01394479,0.2127716],"study_design_scores_gemma":[0.00003623137,0.00002899499,0.00004610461,0.00003791229,0.00001472978,0.00003384476,0.00001498084,0.9038864,0.0006142954,0.08859155,0.006687263,0.000007693598],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002951544,0.0008388719,0.9824225,0.0004323825,0.0001002889,0.00009514619,0.0000953103,0.0003351053,0.01272879],"genre_scores_gemma":[0.1243824,0.001270719,0.8563005,0.000394446,0.000184167,0.0003959594,0.0004786711,0.0003281505,0.01626507],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01614548,"threshold_uncertainty_score":0.05401194,"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."}}