{"id":"W2897914761","doi":"10.1080/0305215x.2018.1524462","title":"Collection network design with capacity planning in reverse logistics: static and restricted-dynamic models","year":2018,"lang":"en","type":"article","venue":"Engineering Optimization","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"National Research Foundation of Korea","keywords":"Heuristics; Time horizon; Data collection; Mathematical optimization; Operations research; Computer science; Integer programming; Dynamic programming; Engineering; Mathematics; Statistics","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.0002578339,0.0001414569,0.0001207966,0.0003670377,0.0001139415,0.0001486464,0.00006569167,0.00004708315,0.00001169882],"category_scores_gemma":[0.0001219891,0.0001470315,0.000007944114,0.001004866,0.00002989208,0.0006889792,0.0000482011,0.00009261604,0.000002431702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001415966,"about_ca_system_score_gemma":0.00001335682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001800708,"about_ca_topic_score_gemma":0.00001633813,"domain_scores_codex":[0.9992127,0.00001175648,0.0001639079,0.0002160696,0.0001292797,0.0002662468],"domain_scores_gemma":[0.9996316,0.00005039161,0.00008111231,0.0001170579,0.0001094741,0.00001037873],"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.00004317485,0.00001009171,0.0003563531,0.0001005052,0.00001140508,0.000012191,0.0001057473,0.9975044,0.000002722065,0.001062201,0.0007242502,0.00006702174],"study_design_scores_gemma":[0.0004077233,0.00002705517,0.0005954065,0.0001101665,0.00002510379,0.000001318488,0.0001614508,0.9976338,0.000001407862,0.0006362269,0.0002268678,0.0001734836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007004969,0.0000262917,0.9918311,0.00009981107,0.0001284955,0.0004198118,2.866207e-7,0.0001610781,0.0003281507],"genre_scores_gemma":[0.7887372,0.0000114423,0.210669,0.000162129,0.0002277119,0.00004432884,0.00002188195,0.00003997699,0.00008637589],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7817323,"threshold_uncertainty_score":0.5995772,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01744114600913093,"score_gpt":0.1932773904357405,"score_spread":0.1758362444266096,"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."}}