{"id":"W1972280695","doi":"10.1007/s10479-011-0876-5","title":"The Robust Set Covering Problem with interval data","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Regret; Benders' decomposition; Mathematical optimization; Interval (graph theory); Theory of computation; Mathematics; Heuristic; Set (abstract data type); Genetic algorithm; Minimax; Context (archaeology); Algorithm; Heuristics; Computer science; Statistics; Combinatorics","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.004867117,0.001088788,0.002584133,0.001281833,0.0004299601,0.002376326,0.002261182,0.002096811,0.002979545],"category_scores_gemma":[0.01844805,0.001245664,0.001795491,0.00287049,0.001447799,0.004129193,0.001892101,0.001927965,0.000290952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001180641,"about_ca_system_score_gemma":0.0008022873,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001658623,"about_ca_topic_score_gemma":0.0007125156,"domain_scores_codex":[0.9965686,0.001986884,0.0001692929,0.0004975629,0.0005786728,0.0001989992],"domain_scores_gemma":[0.9864759,0.01087059,0.001013902,0.001007351,0.000370825,0.000261455],"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.00015956,0.00007737563,0.0008029463,0.0003080499,0.0002198873,0.0002171045,0.0001015935,0.8410534,0.0009522554,0.1090239,0.003003522,0.04408043],"study_design_scores_gemma":[0.00001862058,0.00004339315,0.0002828933,0.00003215787,0.00003034376,0.00008484744,0.0000293027,0.8979473,0.0003506387,0.09971602,0.001447001,0.00001758203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03925949,0.001765613,0.953702,0.0007522263,0.00009445363,0.00005632306,0.0004758497,0.0001155587,0.00377863],"genre_scores_gemma":[0.6718308,0.003411815,0.3170476,0.0002512246,0.000662316,0.000310943,0.001540945,0.0002409428,0.004703404],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004867117,"threshold_uncertainty_score":0.02574009,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.5469561555470586,"score_gpt":0.4569992869582814,"score_spread":0.08995686858877716,"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."}}