{"id":"W4389224571","doi":"10.1287/moor.2022.0335","title":"Proximity and Flatness Bounds for Linear Integer Optimization","year":2023,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Polyhedron; Combinatorics; Unimodular matrix; Cutting-plane method; Integer programming; Integer (computer science); Linear programming; Linear programming relaxation; Integer points in convex polyhedra; Hyperplane; Vertex (graph theory); Polytope; Regular polygon; Discrete mathematics; Branch and price; Mathematical optimization; Computer science; Geometry","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true,"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.006735384,0.002599343,0.001902434,0.003220735,0.001797292,0.003968237,0.002908892,0.001428672,0.01126702],"category_scores_gemma":[0.03834982,0.001145025,0.002083045,0.003684177,0.005327294,0.01429341,0.006344995,0.01089114,0.001945112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002423909,"about_ca_system_score_gemma":0.0009988543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001668349,"about_ca_topic_score_gemma":0.001171137,"domain_scores_codex":[0.9935445,0.002059342,0.0002846922,0.001255246,0.002199722,0.0006564231],"domain_scores_gemma":[0.9718871,0.02216132,0.001918435,0.002046384,0.00116427,0.0008225042],"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.0002684326,0.0001364565,0.001157135,0.0006130295,0.00007307217,0.0002327248,0.0006039696,0.1085057,0.003414051,0.8036208,0.00484409,0.07653056],"study_design_scores_gemma":[0.00002722221,0.000195933,0.0006566473,0.0001717084,0.00003961257,0.000162452,0.0001489528,0.2254503,0.002881482,0.7598311,0.01038638,0.00004827131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0145246,0.004410611,0.9423844,0.001700012,0.0002638295,0.0001153359,0.0002023011,0.0003302492,0.03606863],"genre_scores_gemma":[0.5450854,0.006968111,0.4292173,0.001918047,0.001608492,0.0006567372,0.0006141005,0.0005535046,0.0133784],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01126702,"threshold_uncertainty_score":0.03769201,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1320531363559367,"score_gpt":0.4352795687934838,"score_spread":0.3032264324375471,"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."}}