{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001998338,0.0001637267,0.0002059862,0.002074916,0.0001432896,0.0001213191,0.0004831634,0.00009167167,0.0001993864],"category_scores_gemma":[0.0001694742,0.0001614179,0.00001919664,0.001885077,0.0005459134,0.0002182893,0.0002727761,0.000302472,0.00002455086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006990625,"about_ca_system_score_gemma":0.00006043755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002587019,"about_ca_topic_score_gemma":0.0004327367,"domain_scores_codex":[0.9981584,0.00007086632,0.000286989,0.0004020877,0.0005797024,0.0005019635],"domain_scores_gemma":[0.9993469,0.00004182668,0.00002189238,0.0003711564,0.00009579365,0.0001223997],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002388,0.0007428746,0.005936706,0.00537057,0.0002611772,0.0001178106,0.00359823,0.08307523,0.0005183336,0.09398702,0.1515179,0.6548502],"study_design_scores_gemma":[0.001125254,0.0002383767,0.002184468,0.003923491,0.00004235275,0.000007136646,0.001538309,0.2642611,0.0004500847,0.0004112332,0.7245677,0.001250503],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.0004225278,0.001413955,0.04933845,0.00002184838,0.0003406232,0.001027399,0.000007844253,0.0001702846,0.947257],"genre_scores_gemma":[0.00872815,0.05794371,0.6011433,0.00001263369,0.0001802132,0.0004702048,0.00002628372,0.0003574742,0.331138],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.6535997,"threshold_uncertainty_score":0.6582433,"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."}}