{"id":"W1965893889","doi":"10.4018/ijsds.2013100104","title":"Multi-Level Programming Approach to a Closed-loop Supply Chain Network Design","year":2013,"lang":"en","type":"article","venue":"International Journal of Strategic Decision Sciences","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Stackelberg competition; Supply chain network; Computer science; Mathematical optimization; Supply chain; Genetic algorithm; Set (abstract data type); MATLAB; Network planning and design; Supply chain management; Mathematics; Computer network; Mathematical economics","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.002475844,0.001455752,0.001418584,0.001047824,0.0007893979,0.00248135,0.001758838,0.002110195,0.004762752],"category_scores_gemma":[0.003597453,0.001064694,0.001338976,0.001228878,0.001174679,0.001442896,0.001772481,0.002248009,0.0004619147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001924983,"about_ca_system_score_gemma":0.002584133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004755755,"about_ca_topic_score_gemma":0.003932884,"domain_scores_codex":[0.9986042,0.0006916083,0.00005003061,0.0001890128,0.0003493342,0.0001157845],"domain_scores_gemma":[0.9981421,0.001360415,0.000129757,0.00004435899,0.0002487176,0.0000745977],"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.00001168869,0.00002143164,0.00007529204,0.00005393158,0.00001664082,0.00003066169,0.00002687325,0.9837726,0.0002564593,0.01133319,0.0001364407,0.004264818],"study_design_scores_gemma":[0.000006699718,0.00002301938,0.00001338806,0.000005994441,0.000005253816,0.00000415864,0.000007087983,0.9943032,0.0001036005,0.005054896,0.0004698498,0.00000273811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003454266,0.0001640007,0.9927016,0.0001614779,0.00002983975,0.00006022072,0.00002420852,0.00006735132,0.003336987],"genre_scores_gemma":[0.3883579,0.0006705064,0.6016549,0.0002021902,0.0000828331,0.0007599775,0.0001261307,0.0001100884,0.008035495],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004762752,"threshold_uncertainty_score":0.01593298,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1362712379831746,"score_gpt":0.3185041895462198,"score_spread":0.1822329515630451,"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."}}