{"id":"W2536571921","doi":"10.4230/oasics.atmos.2016.6","title":"Multi-Column Generation Model for the Locomotive Assignment Problem","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Railway Systems and Energy Efficiency","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Column generation; Train; Decomposition; Column (typography); Computer science; Set (abstract data type); Decomposition method (queueing theory); Generator (circuit theory); Heuristics; Assignment problem; Process (computing); Fraction (chemistry); Mathematical optimization; Algorithm; Mathematics; Power (physics)","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":true,"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.0004879423,0.0003344081,0.0002949584,0.00009712882,0.0003513214,0.0001664924,0.0004194051,0.0001752457,0.00001349649],"category_scores_gemma":[0.00003585418,0.0001987125,0.0002121963,0.0001074126,0.00006666343,0.0006366774,0.00006576589,0.0001257162,0.00004853631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002373297,"about_ca_system_score_gemma":0.00003920093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008833895,"about_ca_topic_score_gemma":0.00006463048,"domain_scores_codex":[0.9980375,0.00001285139,0.0008452033,0.0001820603,0.0002932631,0.0006291003],"domain_scores_gemma":[0.9989449,0.0001240555,0.0001704478,0.0004591025,0.0001825049,0.000119011],"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.0000521454,0.0002518493,0.0004092037,0.0006661817,0.0004023864,6.248415e-7,0.00997136,0.9165153,0.005478085,0.004174418,0.02427701,0.03780146],"study_design_scores_gemma":[0.002118117,0.00008789707,0.00004707175,0.00009239162,0.00003259193,0.000005356805,0.0002877955,0.9643477,0.001999386,0.00007269158,0.03058632,0.0003226541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02237425,0.00007381492,0.9729409,0.0001932111,0.0008569297,0.002016827,0.0004970365,0.0002303825,0.000816614],"genre_scores_gemma":[0.970422,0.00006445617,0.02555901,0.0001654503,0.0002983681,0.001431707,0.0001205293,0.00008560394,0.001852922],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9480477,"threshold_uncertainty_score":0.8103259,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02992468883635889,"score_gpt":0.2324706783762818,"score_spread":0.2025459895399229,"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."}}