{"id":"W2606049180","doi":"10.1007/978-3-319-57351-9_16","title":"A Worst-Case Analysis of Constraint-Based Algorithms for Exact Multi-objective Combinatorial Optimization","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Solver; Computer science; Constraint (computer-aided design); Benchmark (surveying); Mathematical optimization; Constraint satisfaction problem; Constraint satisfaction; Algorithm; Linear subspace; Constraint programming; Combinatorial optimization; Mathematics; Artificial intelligence","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.01571574,0.004452983,0.002766363,0.002664572,0.00189469,0.006462424,0.006642145,0.003506981,0.01635413],"category_scores_gemma":[0.05341424,0.001825097,0.003357971,0.005420094,0.003388252,0.007547159,0.003794768,0.007295774,0.002034827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005403598,"about_ca_system_score_gemma":0.004284835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004179647,"about_ca_topic_score_gemma":0.004597441,"domain_scores_codex":[0.9844878,0.006544769,0.0005043459,0.001355325,0.0053987,0.001709059],"domain_scores_gemma":[0.9474217,0.04183995,0.001737541,0.004069601,0.004070898,0.0008604023],"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.0009541988,0.0003491694,0.0007245336,0.0005815726,0.0001896454,0.0001289755,0.00009707798,0.8166792,0.002286646,0.08506884,0.01068153,0.08225863],"study_design_scores_gemma":[0.00002164233,0.00008678837,0.0001395672,0.00005268139,0.00003397311,0.0000707349,0.00002230418,0.9759789,0.0006152172,0.02192598,0.00103762,0.00001459246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01388489,0.004461787,0.9488355,0.001051,0.0003878533,0.0003433481,0.0002981296,0.0006343438,0.03010314],"genre_scores_gemma":[0.2970725,0.002864374,0.6822975,0.001069316,0.0008148889,0.0008354837,0.0007788154,0.00152743,0.01273969],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01635413,"threshold_uncertainty_score":0.08311373,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02781425206499943,"score_gpt":0.2998046618143593,"score_spread":0.2719904097493599,"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."}}