{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01226874,0.0002147198,0.000386122,0.0001936082,0.0002500533,0.000078515,0.0002244862,0.0002368492,0.0003229681],"category_scores_gemma":[0.0005841827,0.0001952223,0.00009185762,0.0003721493,0.000162023,0.0002638159,0.000006702639,0.0004874486,0.00001226731],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009071784,"about_ca_system_score_gemma":0.00003383786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009976967,"about_ca_topic_score_gemma":0.00003625083,"domain_scores_codex":[0.995252,0.002607153,0.0005090815,0.0005047779,0.0005110803,0.0006158804],"domain_scores_gemma":[0.9948059,0.004300167,0.00004593808,0.0002834515,0.0002630586,0.000301503],"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.0002554586,0.0002166008,0.001087407,0.0001523665,0.0001070559,0.000006742075,0.001830976,0.6603667,0.04273468,0.01429151,0.0007177676,0.2782328],"study_design_scores_gemma":[0.002169084,0.0007922198,0.06435791,0.0000458148,0.00007246063,0.000004691832,0.0005846674,0.8266446,0.06822737,0.01254659,0.02388417,0.0006704252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05970383,0.0001466437,0.9379455,0.0005157872,0.0000939612,0.0008652991,0.0000491038,0.0003850965,0.0002947634],"genre_scores_gemma":[0.1930938,0.00009903411,0.8059148,0.00008624676,0.0002083531,0.0003669999,0.00007832677,0.00004288213,0.0001096162],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2775624,"threshold_uncertainty_score":0.7960933,"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."}}