{"id":"W2108911946","doi":"10.1287/ijoc.2013.0550","title":"Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems","year":2013,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":258,"is_retracted":false,"has_abstract":true,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Vehicle routing problem; Mathematical optimization; Heuristic; Computer science; Routing (electronic design automation); Index (typography); Production (economics); Branch and cut; Algorithm; Order (exchange); Enumeration; Integer programming; Operations research; Mathematics; Economics","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.001985895,0.002059252,0.002040935,0.001531191,0.0008625737,0.00246641,0.002196633,0.001955056,0.006907423],"category_scores_gemma":[0.004341541,0.001073559,0.001281625,0.002945084,0.0009260601,0.002029324,0.001493097,0.003097437,0.001057476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001792751,"about_ca_system_score_gemma":0.002303587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005980784,"about_ca_topic_score_gemma":0.005287342,"domain_scores_codex":[0.9988397,0.0004122475,0.00006844925,0.0002062371,0.0003285257,0.0001448979],"domain_scores_gemma":[0.9980329,0.001302887,0.0002067745,0.00009721113,0.0002851956,0.00007501413],"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.00005178081,0.00009166099,0.0002091327,0.0001303935,0.00003556495,0.00006055823,0.0000496114,0.9157146,0.0004507655,0.02783003,0.002638188,0.05273772],"study_design_scores_gemma":[0.00002726143,0.00002076739,0.00003591346,0.00001671918,0.000009413842,0.0000193143,0.00002273975,0.9794589,0.0002489371,0.01855033,0.001583911,0.000005807394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005575381,0.0007061398,0.9879746,0.0003066277,0.00006188166,0.0001483937,0.0001877104,0.0002799911,0.004759222],"genre_scores_gemma":[0.09317124,0.001086393,0.90005,0.000181538,0.0001224281,0.0006261446,0.0007101484,0.0002129716,0.00383911],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006907423,"threshold_uncertainty_score":0.02310765,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02831864026295009,"score_gpt":0.2741303086561243,"score_spread":0.2458116683931742,"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."}}