{"id":"W1987229601","doi":"10.1057/palgrave.jors.2601742","title":"Minisum collection depots location problem with multiple facilities on a network","year":2004,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Lagrangian relaxation; Computer science; Facility location problem; Service (business); Set (abstract data type); Tree network; Mathematical optimization; Purchasing; Operations research; Node (physics); Network planning and design; Relaxation (psychology); Tree (set theory); Branch and bound; Flow network; Computer network; Mathematics; Algorithm; Operations management; Engineering","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.001425371,0.001587164,0.002168544,0.001420046,0.001564546,0.002144948,0.002517681,0.002603068,0.008468098],"category_scores_gemma":[0.002771593,0.001162071,0.000975944,0.003513304,0.001023429,0.00351521,0.002246101,0.001067199,0.0007928375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001841813,"about_ca_system_score_gemma":0.001020456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005513027,"about_ca_topic_score_gemma":0.005178146,"domain_scores_codex":[0.999201,0.0003034093,0.00004316766,0.000149819,0.00009812772,0.000204544],"domain_scores_gemma":[0.9986783,0.000812019,0.0001780631,0.00007867683,0.00009552418,0.0001574746],"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.0005951386,0.0002133792,0.001350952,0.0004635638,0.000117299,0.0007435225,0.0002004619,0.8987488,0.002161892,0.05032948,0.006356121,0.03871937],"study_design_scores_gemma":[0.0001304948,0.0002064611,0.0007898224,0.00003836915,0.00007099885,0.0004793046,0.0003254364,0.9488836,0.001565628,0.04159197,0.005885886,0.00003214134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4031298,0.002526932,0.5608447,0.0024631,0.0002087405,0.0004635057,0.001956373,0.0005922415,0.02781459],"genre_scores_gemma":[0.8118283,0.001691071,0.1629484,0.0002306487,0.0001926885,0.0004068392,0.001293667,0.0001659867,0.02124237],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008468098,"threshold_uncertainty_score":0.0283286,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05802353771575256,"score_gpt":0.2956048896609401,"score_spread":0.2375813519451875,"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."}}