{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001539875,0.0003069646,0.0003658567,0.0000626915,0.0002188295,0.00007261543,0.0002097121,0.0002630925,0.00003321854],"category_scores_gemma":[0.00003961959,0.0002983636,0.00008139505,0.0004917108,0.00006076896,0.0001221653,0.00002646372,0.0003763206,0.00000695141],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001674621,"about_ca_system_score_gemma":0.00002698021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000130571,"about_ca_topic_score_gemma":0.00007084248,"domain_scores_codex":[0.998008,0.00006444369,0.0003990414,0.0003232722,0.0002097196,0.0009955408],"domain_scores_gemma":[0.9984758,0.0006710718,0.00008733827,0.0003960465,0.0001493861,0.0002203234],"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.0000583923,0.00003216715,0.001313481,0.0000460709,0.00004851758,0.000004332908,0.00003670489,0.9539238,0.00001134359,0.00003577447,0.00320687,0.0412826],"study_design_scores_gemma":[0.001593494,0.00007424855,0.0006317828,0.0001033729,0.00004280705,0.000004708829,0.00000684291,0.990298,0.0001515581,0.0000429584,0.00666621,0.0003840031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002178318,0.0004087249,0.9934382,0.0000414941,0.0007170809,0.0009141879,0.00001094225,0.000865855,0.001425153],"genre_scores_gemma":[0.2756963,0.00002210169,0.7227364,0.0002738641,0.0008516232,0.0001083026,0.00009887153,0.0001409404,0.00007154372],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.273518,"threshold_uncertainty_score":0.9999468,"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."}}