{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001920474,0.00009711744,0.0001054657,0.00008005051,0.000910662,0.0002775995,0.0002749768,0.00004787725,0.00009204506],"category_scores_gemma":[0.0003222894,0.00005982775,0.0001165287,0.0009679717,0.0001156936,0.0006918169,0.00008797679,0.0003767947,0.00005977886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002808955,"about_ca_system_score_gemma":0.0003573445,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005797337,"about_ca_topic_score_gemma":0.0009490114,"domain_scores_codex":[0.9980118,0.00004707833,0.0003108562,0.0001346883,0.001259649,0.0002359419],"domain_scores_gemma":[0.9980618,0.00005998678,0.0001016108,0.0001521716,0.001606056,0.00001832789],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002390758,0.0002779244,0.004905635,0.0001550523,0.000115972,0.000001241278,0.000644404,0.8710411,0.0002106088,0.02634819,0.09572556,0.0003352771],"study_design_scores_gemma":[0.01137324,0.001044527,0.2103162,0.001683916,0.000156109,0.00004048883,0.01962653,0.1120378,0.001218721,0.04183782,0.5995615,0.001103176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8766805,0.0001747912,0.01303834,0.09619011,0.00105748,0.001745121,0.000005242124,0.000048867,0.01105954],"genre_scores_gemma":[0.9935076,0.00003470558,0.001727449,0.001084998,0.0008174108,0.00003094192,0.000006370251,0.000009445364,0.002781039],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7590033,"threshold_uncertainty_score":0.7004168,"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."}}