{"id":"W2035888716","doi":"10.1007/s13675-013-0012-1","title":"Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem","year":2013,"lang":"en","type":"article","venue":"EURO Journal on Computational Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Kronos (Canada); Group for Research in Decision Analysis; Université du Québec à Montréal; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Depot; Mathematical optimization; Scheduling (production processes); Multi-commodity flow problem; Computer science; Flow network; Column generation; Set (abstract data type); Mathematics; Operations research","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007499827,0.0002064431,0.0001883646,0.0001388826,0.0005945988,0.0004841136,0.0001491425,0.0000694719,0.00004940549],"category_scores_gemma":[0.0004570101,0.000174938,0.00006891959,0.0002441421,0.00003857182,0.0005059649,0.00003198683,0.0002917591,0.00001136099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007282359,"about_ca_system_score_gemma":0.00003968032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004180284,"about_ca_topic_score_gemma":5.895095e-7,"domain_scores_codex":[0.9984651,0.0001874301,0.0005706673,0.0001886952,0.0003206556,0.0002674771],"domain_scores_gemma":[0.997314,0.00185548,0.0002084324,0.0001041988,0.0004082909,0.0001095468],"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.00001327349,0.00001542781,0.0004347948,0.00003211233,0.00004589224,7.633175e-7,0.0004667925,0.9946454,0.00009152549,0.0005224018,0.0002871951,0.003444383],"study_design_scores_gemma":[0.0008468358,0.00007172333,0.0009926172,0.00005844208,0.00002141974,0.00004220438,0.0001760028,0.9960214,0.0001162212,0.001284502,0.0001690464,0.0001996029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05651757,0.0001882964,0.9412881,0.0008707733,0.000289341,0.0004937843,0.00001100348,0.0001685869,0.0001725527],"genre_scores_gemma":[0.4465862,0.00004405027,0.5527569,0.0002561139,0.000205854,0.00003704308,0.00003104835,0.00005123164,0.00003159959],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3900686,"threshold_uncertainty_score":0.7133764,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03596227856412682,"score_gpt":0.2892528394277084,"score_spread":0.2532905608635816,"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."}}