{"id":"W4400083923","doi":"10.1007/978-3-031-57603-4_11","title":"Decomposition-Based Algorithms for Mixed-Integer Linear Programs with Integer Subproblems","year":2024,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Integer (computer science); Integer programming; Decomposition; Branch and price; Algorithm; Integer points in convex polyhedra; Mathematics; Computer science; Chemistry","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":["metaepi_narrow","bibliometrics","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["sts"],"category_scores_codex":[0.01733301,0.0009935473,0.0007521599,0.01583913,0.003195338,0.005820809,0.008044276,0.0003127692,0.001537208],"category_scores_gemma":[0.00152348,0.0009220873,0.0002478558,0.006770297,0.0109509,0.00634416,0.004173872,0.002624125,0.0003982107],"about_ca_system_candidate":true,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007425309,"about_ca_system_score_gemma":0.00161583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003035518,"about_ca_topic_score_gemma":0.006867468,"domain_scores_codex":[0.9784124,0.0002774851,0.002120497,0.003686524,0.01293673,0.002566324],"domain_scores_gemma":[0.988396,0.0006526631,0.0001544356,0.001950471,0.008297211,0.0005492022],"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.0003641815,0.0005521721,0.00003655032,0.0003042191,0.0002019489,0.0002735282,0.0004022321,0.2230521,0.00008087789,0.7702958,0.001112056,0.003324366],"study_design_scores_gemma":[0.002148353,0.0007699134,0.00008487417,0.002989471,0.00004556002,0.00005782238,0.003983457,0.70098,0.0005134104,0.1452089,0.1417857,0.001432562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0006996649,0.0002090995,0.1965102,0.03266444,0.004772847,0.01971576,0.0007494297,0.0006061639,0.7440724],"genre_scores_gemma":[0.02275399,0.001920301,0.3186157,0.0001440517,0.0005629435,0.009413782,0.001200185,0.0003094923,0.6450796],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.6250869,"threshold_uncertainty_score":0.9996769,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.103711983526411,"score_gpt":0.4669312734795457,"score_spread":0.3632192899531347,"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."}}