{"id":"W4230415688","doi":"10.1002/net.20208","title":"Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Tabu search; Mathematical optimization; Maxima and minima; Guided Local Search; Local optimum; Local search (optimization); Multi-commodity flow problem; Convergence (economics); Flow network; Heuristic; Mathematics; Minimum-cost flow problem; Computer science; Algorithm","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.001337985,0.001111288,0.001205334,0.001420864,0.0006929411,0.0009101636,0.001572582,0.001176055,0.004142303],"category_scores_gemma":[0.003927854,0.0007367602,0.0007692013,0.00158281,0.001001705,0.001346916,0.001353203,0.001325903,0.0004060754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001572872,"about_ca_system_score_gemma":0.00155352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008718255,"about_ca_topic_score_gemma":0.006873146,"domain_scores_codex":[0.999546,0.0002268165,0.00001486653,0.00005061144,0.0001012282,0.00006037661],"domain_scores_gemma":[0.9985908,0.001055314,0.00009535327,0.00006979495,0.0001360528,0.00005264933],"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.00002788805,0.00002659006,0.0001240318,0.00004201624,0.00001631982,0.00001064354,0.0000371149,0.9520798,0.0002117507,0.01927907,0.0006568215,0.0274879],"study_design_scores_gemma":[0.000007283015,0.000009823424,0.00001692014,0.000004631154,0.000001987588,0.000002769009,0.000004151942,0.9926429,0.000092513,0.00689119,0.0003232284,0.000002549591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01376076,0.0003434384,0.9827823,0.0001403267,0.00002110835,0.00008344057,0.00003816008,0.0002064501,0.002623969],"genre_scores_gemma":[0.3735976,0.0005546988,0.619341,0.0001140299,0.00004144803,0.0005821355,0.0002115551,0.000233488,0.005324065],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008718255,"threshold_uncertainty_score":0.017335,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01783978272861802,"score_gpt":0.2649947361305507,"score_spread":0.2471549534019327,"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."}}