{"id":"W2017660874","doi":"10.1155/2012/178651","title":"A Compromise Programming Model for Highway Maintenance Resources Allocation Problem","year":2012,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Infrastructure Maintenance and Monitoring","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"Transport Canada","funders":"Natural Science Foundation of Beijing Municipality","keywords":"Compromise; Bridge (graph theory); Computer science; Mathematical optimization; Resource allocation; Resource (disambiguation); Programming paradigm; Optimal maintenance; Operations research; Engineering; Mathematics","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.001548414,0.001146958,0.001252854,0.0007544358,0.0005469256,0.002316961,0.001547785,0.002195874,0.004152773],"category_scores_gemma":[0.002703795,0.0007824003,0.00115619,0.001222479,0.0009558972,0.0017408,0.001494401,0.0022558,0.0006045979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001663716,"about_ca_system_score_gemma":0.001478831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00266504,"about_ca_topic_score_gemma":0.001868913,"domain_scores_codex":[0.9989845,0.0004166287,0.00004070309,0.0002011362,0.0002389806,0.0001180118],"domain_scores_gemma":[0.9992268,0.0004928276,0.00007476414,0.00002877361,0.0001228417,0.00005403033],"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.00002160442,0.00002515102,0.0001072426,0.00005364799,0.00001707242,0.00007615773,0.00005507662,0.960188,0.0005736434,0.03277884,0.0005011377,0.005602334],"study_design_scores_gemma":[0.000006154875,0.00002015271,0.00003076059,0.000009240761,0.000005615227,0.00002232664,0.00001328752,0.9845868,0.0001371789,0.01425132,0.0009106572,0.000006470808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006713269,0.0002747268,0.9852334,0.0002829625,0.0000259088,0.00003967213,0.00007620367,0.00007510385,0.007278704],"genre_scores_gemma":[0.634508,0.001348575,0.3441041,0.0002467308,0.00009644109,0.0007140154,0.0003640126,0.0001439809,0.01847417],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004152773,"threshold_uncertainty_score":0.01389241,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01274814095388648,"score_gpt":0.2162638041078384,"score_spread":0.2035156631539519,"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."}}