{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001101407,0.000149022,0.0002125511,0.0003380722,0.0003422745,0.0002036252,0.00135677,0.00002896253,0.000004691969],"category_scores_gemma":[0.00005235514,0.000141869,0.00007670421,0.00177187,0.0003447951,0.000902725,0.0003132528,0.00007154603,0.000005079595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004981656,"about_ca_system_score_gemma":0.00005133018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006737624,"about_ca_topic_score_gemma":0.000006251613,"domain_scores_codex":[0.9979295,0.00003590271,0.0003905418,0.0005958653,0.0005957953,0.0004523791],"domain_scores_gemma":[0.9988565,0.00006149553,0.0001984975,0.0005825211,0.0002031451,0.00009786531],"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.000004431092,0.000397269,0.0007459875,0.0001729574,0.00001593033,0.000001233415,0.0009993281,0.07182594,0.00007926323,0.8167278,0.0003517877,0.1086781],"study_design_scores_gemma":[0.0003750293,0.0001135848,0.0001130692,0.00005782977,0.00001075781,0.000001204854,0.0001864375,0.964763,0.002096918,0.01756447,0.01453721,0.0001804273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009358082,0.00005594781,0.9930423,0.0001431199,0.0004522394,0.001221575,0.000002002629,0.0001012235,0.004045725],"genre_scores_gemma":[0.5320796,0.000006678216,0.4675307,0.00004693522,0.00001016797,0.0001372198,0.000001915215,0.000005624112,0.0001812216],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8929371,"threshold_uncertainty_score":0.578525,"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."}}