{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002052452,0.001988318,0.0009254541,0.001119162,0.0006194527,0.001460922,0.001558918,0.001330668,0.006924072],"category_scores_gemma":[0.004062797,0.0007877628,0.001711962,0.00127231,0.001335674,0.00124358,0.001802026,0.003128401,0.001478612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001282796,"about_ca_system_score_gemma":0.001752493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001881115,"about_ca_topic_score_gemma":0.002228773,"domain_scores_codex":[0.9991677,0.0003021904,0.00003899538,0.0001161377,0.0003105867,0.00006442724],"domain_scores_gemma":[0.9988913,0.0007190414,0.00009741024,0.0001142191,0.0001413404,0.00003674042],"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.00004850108,0.0000682531,0.0003142355,0.0002811023,0.00004374526,0.00009844468,0.00009466015,0.7659032,0.002368784,0.1510588,0.003082261,0.07663795],"study_design_scores_gemma":[0.00002022313,0.00005019388,0.00006273159,0.00004462702,0.00001436227,0.00006368375,0.00002106614,0.9084287,0.001237225,0.08073562,0.009309875,0.00001165415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008443709,0.0000756233,0.9964206,0.00006801285,0.00001383552,0.00003894075,0.00002961649,0.00007993897,0.002429082],"genre_scores_gemma":[0.0470403,0.000397816,0.9489138,0.0001396749,0.0000469887,0.0003894777,0.0002082828,0.0001385918,0.00272516],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006924072,"threshold_uncertainty_score":0.02316332,"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."}}