{"id":"W2230461717","doi":"10.1007/s10479-015-2091-2","title":"Exact and heuristic approaches for the cycle hub location problem","year":2016,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Bounding overwatch; Benchmark (surveying); Mathematical optimization; Metaheuristic; Theory of computation; Heuristic; Tree (set theory); Steiner tree problem; Network topology; Tree network; Set (abstract data type); Flow network; Branch and bound; Network planning and design; Routing (electronic design automation); Algorithm; Mathematics","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.002635473,0.001288048,0.001378375,0.00195224,0.0006348266,0.001923988,0.002365374,0.001988708,0.005541363],"category_scores_gemma":[0.01033393,0.001108274,0.001026553,0.002589905,0.001572514,0.002642233,0.001535039,0.002352632,0.0004613309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002003323,"about_ca_system_score_gemma":0.002594477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01019938,"about_ca_topic_score_gemma":0.01130249,"domain_scores_codex":[0.9987106,0.0006445635,0.00005156692,0.0001274382,0.0003355794,0.0001302358],"domain_scores_gemma":[0.9949196,0.004088865,0.0002339456,0.0002730387,0.0003644307,0.0001200748],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005210116,0.00007332245,0.0001605602,0.0001140676,0.00002747354,0.00002463243,0.00004659956,0.9139516,0.0001459777,0.05542812,0.00174771,0.0282278],"study_design_scores_gemma":[0.00001679308,0.00001559784,0.00005046091,0.0000154828,0.00000759925,0.000008918907,0.00001983333,0.9606891,0.00005505971,0.03823469,0.0008806521,0.000005902711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01206301,0.001962267,0.9747528,0.0005951371,0.000185815,0.00007567123,0.0001245725,0.000107033,0.0101336],"genre_scores_gemma":[0.391465,0.003237769,0.5934335,0.0003023961,0.0005118035,0.0003594788,0.0002952635,0.0002089942,0.01018579],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01019938,"threshold_uncertainty_score":0.02028006,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2801187575592472,"score_gpt":0.4286605279168331,"score_spread":0.1485417703575859,"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."}}