{"id":"W2111731757","doi":"10.1287/ijoc.1090.0335","title":"A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion","year":2009,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":108,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical optimization; Subgradient method; Heuristic; Computer science; Queue; Branch and bound; Transshipment (information security); Nonlinear system; Upper and lower bounds; Flow network; Nonlinear programming; Integer (computer science); Piecewise linear function; Network congestion; Cutting-plane method; Integer programming; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008189194,0.00006824125,0.00009704735,0.00008313281,0.0008870974,0.0001814014,0.00003293942,0.00005030614,7.351959e-7],"category_scores_gemma":[0.00007188929,0.00005284489,0.00001540536,0.0001165643,0.00002967355,0.0002211507,8.414177e-7,0.0001264146,4.409144e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006061222,"about_ca_system_score_gemma":0.00005135224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003699084,"about_ca_topic_score_gemma":0.00005760751,"domain_scores_codex":[0.999393,0.00004170832,0.0001766177,0.00007694672,0.0001652798,0.0001464722],"domain_scores_gemma":[0.9994001,0.0001603824,0.0001766592,0.00001929656,0.0001556952,0.00008787946],"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.0008869478,0.00006659742,0.02279332,0.0001317995,0.0000738168,0.00001672779,0.05080334,0.697893,0.00005509582,0.06940759,0.0002248974,0.1576468],"study_design_scores_gemma":[0.006013921,0.00459236,0.319061,0.002387415,0.0002354223,0.000698236,0.014769,0.6449179,0.0001626616,0.002301563,0.003866575,0.0009938789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4439778,0.00002050253,0.5549315,0.000232434,0.00009636467,0.0001857406,0.000001049621,0.00007494193,0.0004796744],"genre_scores_gemma":[0.9852628,0.00001239409,0.0144608,0.00009334909,0.0001455236,8.16019e-7,0.00000204763,0.000003635111,0.00001865863],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.541285,"threshold_uncertainty_score":0.6822926,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03055224279145047,"score_gpt":0.271753126021591,"score_spread":0.2412008832301405,"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."}}