{"id":"W2758864124","doi":"","title":"An Extended Branch-and-Bound Method for Locomotive Assignment","year":2003,"lang":"fr","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Backtracking; Branch and bound; Mathematical optimization; Computer science; Heuristic; Node (physics); Set (abstract data type); Branch and cut; Branch and price; Integer programming; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003986191,0.0007626431,0.0008139361,0.0004555334,0.0004541472,0.0004455119,0.0004415297,0.0008049358,0.0001794197],"category_scores_gemma":[0.0008292544,0.0009296944,0.0002699133,0.0006754578,0.0001662447,0.0006814753,0.00008666355,0.000728336,0.00001297546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001258194,"about_ca_system_score_gemma":0.0002945692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002328904,"about_ca_topic_score_gemma":0.000533836,"domain_scores_codex":[0.9950089,0.001332324,0.0008999271,0.0009147365,0.0003964778,0.00144767],"domain_scores_gemma":[0.9967518,0.0008552637,0.0002838511,0.001090094,0.0002408818,0.0007780546],"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.00007521891,0.0005044235,0.002540364,0.000363242,0.000281886,0.00002473694,0.001142539,0.5524561,0.02429324,0.2140194,0.001102639,0.2031962],"study_design_scores_gemma":[0.001425745,0.0004158959,0.004081483,0.0001470638,0.0002273412,0.0001670949,0.0002418264,0.8964472,0.06471837,0.01946123,0.0116912,0.0009755757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004906262,0.008846175,0.9782068,0.003026145,0.0007870281,0.002171424,0.0001609406,0.001010323,0.0008849512],"genre_scores_gemma":[0.09989394,0.0005366653,0.8947339,0.0008938177,0.0002479145,0.0009336701,0.00003396611,0.0002928552,0.002433253],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3439911,"threshold_uncertainty_score":0.9993154,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01475733785249362,"score_gpt":0.2841046295085984,"score_spread":0.2693472916561048,"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."}}