{"id":"W2125401464","doi":"10.1287/mnsc.49.9.1268.16570","title":"A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems","year":2003,"lang":"en","type":"article","venue":"Management Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":205,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Mathematics; Integer programming; Mathematical optimization; Separable space; Linear programming; Piecewise linear function; Minification; Duality (order theory); Linear programming relaxation; Piecewise; Branch and price; Lagrangian relaxation; Relaxation (psychology); Regular polygon; Envelope (radar); Convex optimization; Strong duality; Function (biology); Applied mathematics; Discrete mathematics; Optimization problem; Computer science; Mathematical analysis","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.003337131,0.001260495,0.001166108,0.0007686925,0.0005044932,0.002733294,0.002204285,0.001379352,0.004366707],"category_scores_gemma":[0.008618033,0.0006623444,0.001239066,0.001769934,0.001204235,0.003586732,0.001559266,0.002216628,0.0003893313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002274547,"about_ca_system_score_gemma":0.001230692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001765541,"about_ca_topic_score_gemma":0.001987302,"domain_scores_codex":[0.9984558,0.0008953645,0.00005356926,0.0001306597,0.0003493138,0.0001152595],"domain_scores_gemma":[0.9963866,0.002636895,0.0002924942,0.000272154,0.0002382487,0.0001735485],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001402982,0.000098623,0.0003487893,0.0001986758,0.00004779587,0.00004805969,0.000123069,0.6482651,0.0003658544,0.3223611,0.00158611,0.02641651],"study_design_scores_gemma":[0.00001389348,0.00006551687,0.0001364942,0.00004394271,0.00001663629,0.00002638707,0.00004760012,0.9374832,0.000211336,0.05989283,0.002050653,0.00001144524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03364591,0.002523861,0.9410205,0.001305011,0.0001311093,0.00008696759,0.0001485721,0.0001427754,0.02099526],"genre_scores_gemma":[0.6726305,0.004156251,0.3125075,0.0003972379,0.0001732421,0.0003910771,0.0003323691,0.0001897955,0.009221995],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004366707,"threshold_uncertainty_score":0.01764864,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06693519417062954,"score_gpt":0.3225695888185658,"score_spread":0.2556343946479362,"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."}}