{"id":"W1988046523","doi":"10.1016/j.trb.2005.05.005","title":"An extended branch-and-bound method for locomotive assignment","year":2005,"lang":"en","type":"article","venue":"Transportation Research Part B Methodological","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Backtracking; Branch and bound; Mathematical optimization; Computer science; Heuristic; Node (physics); Integer programming; Branch and cut; Set (abstract data type); Branch and price; Operations research; Mathematics; Engineering","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.001916035,0.001296362,0.002198966,0.00121308,0.000756004,0.001234155,0.0024732,0.001792986,0.009635057],"category_scores_gemma":[0.003362383,0.0008724083,0.001110736,0.001985661,0.0006977288,0.001471947,0.001460181,0.00203092,0.001903487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007467751,"about_ca_system_score_gemma":0.001870278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008564551,"about_ca_topic_score_gemma":0.007437737,"domain_scores_codex":[0.9991886,0.000336399,0.00002805447,0.00009453938,0.0002764547,0.00007590232],"domain_scores_gemma":[0.9986742,0.0008193066,0.00005104538,0.00009351784,0.0003002556,0.00006170539],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001426436,0.0001205028,0.0002223736,0.0001814272,0.00006715957,0.00005144517,0.00005882612,0.7762814,0.001294462,0.01653915,0.004307511,0.2007332],"study_design_scores_gemma":[0.00001759566,0.00001585597,0.00004162472,0.00000904969,0.000009536599,0.000007224489,0.000003791078,0.9942181,0.0001422729,0.004345608,0.001185519,0.000003824388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001640631,0.000126109,0.9960318,0.00004646723,0.00005046598,0.00003816991,0.0000407719,0.0001823428,0.001843193],"genre_scores_gemma":[0.0669376,0.0002923852,0.924836,0.0001042723,0.0001241674,0.0003380145,0.0002303817,0.0002700663,0.00686709],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009635057,"threshold_uncertainty_score":0.03223246,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2908236024395113,"score_gpt":0.4962665487751037,"score_spread":0.2054429463355924,"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."}}