{"id":"W3007151168","doi":"10.1139/cjce-2019-0368","title":"Dynamic programming of 0/1 knapsack problem for network-level pavement asset management system","year":2020,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Infrastructure Maintenance and Monitoring","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Knapsack problem; Ant colony optimization algorithms; Computer science; Mathematical optimization; Set (abstract data type); Swarm intelligence; Metaheuristic; Asset (computer security); Operations research; Scale (ratio); Dynamic programming; Optimization problem; Transport engineering; Particle swarm optimization; Engineering; Algorithm; Mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001131202,0.001092266,0.0009280532,0.0005899047,0.0007179768,0.001846689,0.0008661593,0.001134485,0.004459527],"category_scores_gemma":[0.001885408,0.0006949069,0.0006980404,0.0008004939,0.0006006569,0.001008631,0.000972814,0.001451562,0.0003274766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001671279,"about_ca_system_score_gemma":0.002081303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03050706,"about_ca_topic_score_gemma":0.02369735,"domain_scores_codex":[0.9994377,0.0002038643,0.00002320968,0.0001095892,0.00010136,0.0001241895],"domain_scores_gemma":[0.9994161,0.0003746112,0.00006400418,0.00001286608,0.0001031297,0.0000293187],"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.0000148267,0.00001561873,0.0001907806,0.00003181642,0.000007163198,0.0000276554,0.00001780584,0.992816,0.0002235434,0.002372786,0.000323994,0.003957953],"study_design_scores_gemma":[0.000003476924,0.00001772196,0.0000783255,0.000004814221,0.000003664447,0.000005500268,0.00001849176,0.9984432,0.0001191783,0.001060158,0.0002426384,0.000002943391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04359801,0.0003945761,0.9400464,0.0004140912,0.00008152975,0.0002291603,0.0002297494,0.0001686517,0.01483789],"genre_scores_gemma":[0.8058233,0.0006697595,0.1811791,0.0001674752,0.00005336711,0.0005691783,0.0003159791,0.00008137325,0.01114049],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03050706,"threshold_uncertainty_score":0.06065899,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008355767044866727,"score_gpt":0.179643260748116,"score_spread":0.1712874937032492,"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."}}