{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000207066,0.0001892749,0.000320309,0.0001626426,0.00004220632,0.00004025146,0.0002309353,0.00006208571,0.000007769539],"category_scores_gemma":[0.00001343874,0.000194339,0.0001300863,0.0002132874,0.00001097961,0.0001127858,0.00001164232,0.0001955321,8.309628e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003277897,"about_ca_system_score_gemma":0.00008361912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002390657,"about_ca_topic_score_gemma":0.00167585,"domain_scores_codex":[0.998722,0.000005148805,0.0005186443,0.0001008239,0.0001448681,0.0005084823],"domain_scores_gemma":[0.9992481,0.00001881125,0.0001144997,0.0001040527,0.0001107289,0.0004038374],"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.000003908938,0.00000136959,0.0002651508,0.001969328,0.0002349449,0.00006769404,0.0002874717,0.988827,0.0004514738,0.0009836634,0.001400103,0.005507919],"study_design_scores_gemma":[0.00269522,0.0005517293,0.004009378,0.005674928,0.0004427025,0.0002345014,0.001797899,0.7712002,0.002104779,0.0001586504,0.2098337,0.00129636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01073235,0.001396875,0.9836316,0.000104633,0.002273856,0.0007165515,0.00004980706,0.0001095455,0.0009847664],"genre_scores_gemma":[0.9566979,0.00001608257,0.04283506,0.00001512048,0.0003459202,0.00001836986,0.000004566223,0.00005702492,0.000009968251],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9459655,"threshold_uncertainty_score":0.7924913,"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."}}