{"id":"W2138131169","doi":"10.1007/s12532-013-0052-9","title":"Local cuts for mixed-integer programming","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Cutting-plane method; Integer programming; Travelling salesman problem; Mathematics; Linear programming relaxation; Context (archaeology); Mathematical optimization; Relaxation (psychology); Theory of computation; Space (punctuation); Integer (computer science); Hyperplane; Point (geometry); Plane (geometry); Range (aeronautics); Linear programming; Algorithm; 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.004407053,0.001542634,0.001801639,0.001461615,0.0009469264,0.002799402,0.002469993,0.001416784,0.007773428],"category_scores_gemma":[0.01691112,0.001170643,0.001140956,0.001556105,0.002290601,0.003371033,0.002647557,0.0056101,0.001157301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00160505,"about_ca_system_score_gemma":0.001234293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001914486,"about_ca_topic_score_gemma":0.002390515,"domain_scores_codex":[0.9979425,0.001137441,0.00006156287,0.0002400187,0.000490567,0.0001279012],"domain_scores_gemma":[0.9923564,0.005969016,0.0004119141,0.0004349705,0.0005844935,0.0002431685],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002710079,0.0001210531,0.0004071568,0.0005138464,0.00009210817,0.00007757995,0.0001764164,0.2496991,0.001297006,0.6487225,0.008171437,0.09045078],"study_design_scores_gemma":[0.00003929618,0.00003828896,0.00007729185,0.00006282501,0.00002203305,0.00002391763,0.00002809773,0.5720349,0.000469445,0.4229816,0.004208935,0.00001340482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002986517,0.0006497258,0.9919613,0.0002404837,0.00008160031,0.00003557799,0.00005882188,0.0001422076,0.003843761],"genre_scores_gemma":[0.1477129,0.0009001528,0.8399299,0.0003151307,0.0002574412,0.0006790247,0.000381142,0.0005476119,0.009276628],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007773428,"threshold_uncertainty_score":0.02600473,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02548378838351857,"score_gpt":0.3091325737675542,"score_spread":0.2836487853840356,"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."}}