{"id":"W1995543118","doi":"10.1177/1548512913509031","title":"An Approximate Dynamic Programming heuristic to support non-strategic project selection for the Royal Canadian Navy","year":2013,"lang":"en","type":"article","venue":"The Journal of Defense Modeling and Simulation Applications Methodology Technology","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Royal Military College of Canada; Royal Ottawa Mental Health Centre","funders":"","keywords":"Knapsack problem; Heuristic; Selection (genetic algorithm); Navy; Operations research; Dynamic programming; Computer science; Heuristics; Mathematical optimization; Fraction (chemistry); Greedy algorithm; Simple (philosophy); Continuous knapsack problem; Engineering; Mathematics; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true,"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.00216143,0.0001455776,0.0002080702,0.0007217107,0.0006096846,0.0001274948,0.0003624168,0.0001289075,0.00001724075],"category_scores_gemma":[0.0001498591,0.00009611278,0.00005046352,0.0005598923,0.00008871929,0.0001801804,0.00004690544,0.0002361855,0.00001195558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005770903,"about_ca_system_score_gemma":0.00006660298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003029412,"about_ca_topic_score_gemma":0.00190653,"domain_scores_codex":[0.9989144,0.00006938127,0.0004363431,0.0001857337,0.0001034943,0.0002906189],"domain_scores_gemma":[0.9986317,0.0002829049,0.0002922126,0.0002641419,0.0005009935,0.00002809534],"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.00005148416,0.00003834338,0.0003215499,0.00003959858,0.00005653705,2.774791e-7,0.0001594158,0.9433002,0.000187911,0.01044945,0.0001480538,0.04524712],"study_design_scores_gemma":[0.0002494439,0.00009865479,0.00004782487,0.000006931787,0.0001471178,0.00001330702,0.001892648,0.9699216,0.00000526288,0.02109094,0.006420925,0.0001053763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1244614,0.00005655207,0.8706148,0.002962388,0.0001073931,0.001607409,0.000001157693,0.00006048484,0.0001283946],"genre_scores_gemma":[0.9621022,0.000009345244,0.03647607,0.0007070046,0.0002180499,0.0004020925,0.000009321979,0.000022375,0.00005349657],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8376408,"threshold_uncertainty_score":0.4689263,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08699307185530128,"score_gpt":0.3388852185796657,"score_spread":0.2518921467243644,"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."}}