{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001263716,0.0008358012,0.00109151,0.000802542,0.0008830173,0.001516515,0.001502789,0.000926519,0.003403869],"category_scores_gemma":[0.004180614,0.0006175917,0.0003368386,0.001190104,0.0008068701,0.0007252058,0.0006623808,0.0006295329,0.0002345767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005072976,"about_ca_system_score_gemma":0.009152206,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.3282191,"about_ca_topic_score_gemma":0.2895106,"domain_scores_codex":[0.9992331,0.0002227989,0.00002279783,0.00007636371,0.0001767001,0.0002683681],"domain_scores_gemma":[0.9988611,0.0006555886,0.00008746961,0.00007075585,0.0001966503,0.0001283468],"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.00005183068,0.00001778245,0.0002749287,0.00001970134,0.00001115722,0.00002048381,0.00002268389,0.9856029,0.0002259318,0.002301034,0.0005293679,0.01092217],"study_design_scores_gemma":[0.00001365055,0.0000130425,0.0001038857,0.000003822307,0.000004799243,0.000004141549,0.00001419993,0.9985201,0.00006777827,0.0009426432,0.0003080334,0.000003876581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3396475,0.001298287,0.6333817,0.001221962,0.0001531789,0.0004731865,0.0005729489,0.00102467,0.02222662],"genre_scores_gemma":[0.8820862,0.0003009735,0.1131894,0.0001284264,0.00002448404,0.0001760804,0.0002187663,0.00007067767,0.003804929],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6717809,"threshold_uncertainty_score":0.6526172,"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."}}