{"id":"W2139575211","doi":"10.1287/ijoc.12.3.223.12638","title":"A Simplex-Based Tabu Search Method for Capacitated Network Design","year":2000,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":167,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Tabu search; Mathematical optimization; Simplex; Integer programming; Set (abstract data type); Network planning and design; Integer (computer science); Mathematics; Column generation; Computer science; Fixed charge; Algorithm; Combinatorics","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":[],"consensus_categories":[],"category_scores_codex":[0.00115237,0.0001490899,0.0002059479,0.00009013067,0.0002619022,0.0002020509,0.000141245,0.00006839224,0.0002150189],"category_scores_gemma":[0.00006963887,0.0001210461,0.0001056163,0.0002570475,0.00001484895,0.000130104,0.000006701237,0.0003402145,0.00003990631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006972288,"about_ca_system_score_gemma":0.00003356343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000112473,"about_ca_topic_score_gemma":2.639025e-7,"domain_scores_codex":[0.9987755,0.00003495737,0.000443776,0.00008000048,0.0001936996,0.0004720519],"domain_scores_gemma":[0.998961,0.0006399751,0.00005070887,0.00009387924,0.00008952881,0.0001648813],"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.0000205773,0.000008673918,0.000002256543,0.00002833173,0.00002105627,0.000002577229,0.0001308732,0.7085003,0.000007874386,0.0002963334,0.000754249,0.2902269],"study_design_scores_gemma":[0.0006382341,0.0001205338,0.000004724255,0.0001112043,0.000009078032,0.00002819057,0.00003037712,0.9839568,0.0002513707,0.0009621308,0.01373078,0.0001565331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00314387,0.00002101739,0.994144,0.00006979647,0.0001586152,0.0002714217,9.416795e-7,0.000243156,0.001947158],"genre_scores_gemma":[0.08858147,0.00000550976,0.9105452,0.0004878836,0.0002738727,0.000004323125,0.000003554187,0.0000385947,0.00005959752],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2900704,"threshold_uncertainty_score":0.4936115,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04292685753506973,"score_gpt":0.3050822956265041,"score_spread":0.2621554380914344,"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."}}