{"id":"W2031202838","doi":"10.1287/trsc.2013.0493","title":"Cutting-Plane Matheuristic for Service Network Design with Design-Balanced Requirements","year":2014,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal","funders":"Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport; Université de Montréal; Université du Québec à Montréal","keywords":"Solver; Network planning and design; Cutting-plane method; Dimension (graph theory); Variable (mathematics); Computer science; Mathematical optimization; Service (business); Quality of service; Plane (geometry); Distributed computing; Integer programming; Mathematics; Computer network","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.001780457,0.0001354106,0.0001449124,0.00006774023,0.0002032882,0.00005813405,0.0002602976,0.00003580981,0.00001143944],"category_scores_gemma":[0.00005957626,0.0001264455,0.00001492144,0.0008807339,0.00006534799,0.0002635256,0.000001481327,0.00006022062,0.000009850561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003559978,"about_ca_system_score_gemma":0.00005606023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003877147,"about_ca_topic_score_gemma":0.000005037286,"domain_scores_codex":[0.9987517,0.00004548466,0.0002566809,0.0002625229,0.0003227065,0.0003608853],"domain_scores_gemma":[0.9991359,0.0002887511,0.00007699291,0.0001994977,0.0002065794,0.00009226832],"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.00002703801,0.000005225151,0.0005403163,0.00004476449,0.00000481199,4.236558e-7,0.0003469298,0.9932724,0.004125208,0.0004520866,0.00004719632,0.001133631],"study_design_scores_gemma":[0.0005300824,0.0000810754,0.007442018,0.00006138621,0.00002628466,0.000001344543,0.00001867668,0.9842376,0.00664008,0.0006340666,0.000127567,0.0001997831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01307469,0.000008914593,0.9857731,0.0000418774,0.0001522967,0.0004311015,0.0000047685,0.0003288289,0.0001844453],"genre_scores_gemma":[0.4392336,0.000002055179,0.5605581,0.0000918467,0.00003138409,0.0000376419,0.00001006106,0.00001991864,0.00001533368],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4261589,"threshold_uncertainty_score":0.5156299,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04324152256923113,"score_gpt":0.2835365767714388,"score_spread":0.2402950542022076,"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."}}