{"id":"W2150889816","doi":"10.1287/trsc.34.2.133.12308","title":"A Benders Decomposition Approach for the Locomotive and Car Assignment Problem","year":2000,"lang":"en","type":"article","venue":"Transportation Science","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":173,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lagrangian relaxation; Decomposition; Column generation; Integer programming; Benders' decomposition; Mathematical optimization; Decomposition method (queueing theory); Simplex algorithm; Context (archaeology); Linear programming relaxation; Computer science; Dynamic programming; Linear programming; Set (abstract data type); Engineering; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.001391064,0.002671767,0.001522569,0.001564194,0.000752868,0.001328525,0.001142452,0.001788028,0.006606546],"category_scores_gemma":[0.001867346,0.001114655,0.00203372,0.001999393,0.0006854505,0.001644659,0.001162089,0.002926039,0.001438163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001110634,"about_ca_system_score_gemma":0.001968104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003789101,"about_ca_topic_score_gemma":0.004288601,"domain_scores_codex":[0.9990036,0.0004165608,0.00004229131,0.0001869954,0.0002428663,0.000107826],"domain_scores_gemma":[0.9995686,0.0002385855,0.00005298117,0.00003319831,0.00006767399,0.00003886246],"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.00007237577,0.0001326341,0.0002750531,0.000289774,0.0001089006,0.000130802,0.0001103639,0.8152722,0.003233144,0.07094666,0.006243726,0.1031844],"study_design_scores_gemma":[0.00003847752,0.00008461023,0.0001629983,0.00004593151,0.0000360236,0.0001180042,0.0000445845,0.9350231,0.0009155512,0.05091731,0.01258911,0.00002435785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002030299,0.0003315064,0.9936092,0.0001426094,0.00004961215,0.00008010329,0.00009597848,0.0001113508,0.003549376],"genre_scores_gemma":[0.05066623,0.001362786,0.9401605,0.0001496269,0.0001276711,0.0004316235,0.0005328192,0.000112633,0.006456096],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006606546,"threshold_uncertainty_score":0.0221011,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01422500301572305,"score_gpt":0.2400552185029919,"score_spread":0.2258302154872689,"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."}}