{"id":"W1528193418","doi":"10.1002/9780470400531.eorms0863","title":"Symmetry Handling in Mixed‐Integer Programming","year":2011,"lang":"en","type":"other","venue":"Wiley Encyclopedia of Operations Research and Management Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Integer programming; Integer (computer science); Symmetry (geometry); Branch and cut; Linear programming; Set (abstract data type); Branch and bound; Mathematics; Mathematical optimization; Integer points in convex polyhedra; Branch and price; Computer science; Combinatorics; Discrete mathematics; 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.003917992,0.0008180069,0.001000229,0.0009064974,0.000769701,0.001842272,0.001395597,0.000522827,0.003876334],"category_scores_gemma":[0.009722997,0.0005785868,0.001200237,0.001157416,0.001245377,0.002059797,0.002029242,0.001712372,0.0006906096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008290202,"about_ca_system_score_gemma":0.001151163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009368833,"about_ca_topic_score_gemma":0.000846356,"domain_scores_codex":[0.9969103,0.001655952,0.0001494722,0.0002481795,0.0008408655,0.0001952239],"domain_scores_gemma":[0.9947253,0.003296137,0.000658889,0.0006559797,0.0005703638,0.00009332768],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002376545,0.0001589994,0.001151298,0.0003380649,0.00008880076,0.000451112,0.0002570932,0.3872233,0.005801155,0.4247276,0.003723382,0.1758415],"study_design_scores_gemma":[0.00003831488,0.00005888223,0.0001299396,0.00004755404,0.00002027021,0.00008621187,0.00004154926,0.833664,0.003879025,0.1561246,0.005895426,0.00001412545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01260102,0.0002150094,0.9779004,0.0001992825,0.00005252865,0.00009234738,0.00005240556,0.0001859053,0.008700931],"genre_scores_gemma":[0.3380979,0.0004498874,0.6564838,0.0001729736,0.0001256304,0.0003386678,0.0002055343,0.0001946776,0.003930926],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003917992,"threshold_uncertainty_score":0.02072054,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03418941115303403,"score_gpt":0.3278533433426749,"score_spread":0.2936639321896408,"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."}}