{"id":"W4226385637","doi":"10.1080/03155986.2022.2040274","title":"Approximating the Pareto frontier for a challenging real-world bi-objective covering problem","year":2022,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Pareto principle; Mathematical optimization; Subgradient method; Heuristic; Computer science; Set (abstract data type); Constraint (computer-aided design); Frontier; Set cover problem; Decision maker; Pareto optimal; Multi-objective optimization; Efficient frontier; Operations research; Mathematics; Economics; Geography","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.003244579,0.0001312864,0.0001633846,0.0004703268,0.002707561,0.001017553,0.0004938942,0.0000316457,0.000009237424],"category_scores_gemma":[0.000266232,0.0001049056,0.00004071141,0.0008546749,0.00006382769,0.003485154,0.0005599558,0.0003432095,0.000009616738],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003933006,"about_ca_system_score_gemma":0.0002948923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002708469,"about_ca_topic_score_gemma":0.00001841898,"domain_scores_codex":[0.997564,0.0001773182,0.0005945939,0.0002158946,0.001082037,0.0003661583],"domain_scores_gemma":[0.9978075,0.0005608992,0.0001978304,0.0002704466,0.001086531,0.00007680251],"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.00002642132,0.00001559047,0.0001623571,0.00008582848,0.00003102318,4.660775e-7,0.009568158,0.5194955,0.00001511874,0.4574276,0.0007205778,0.01245139],"study_design_scores_gemma":[0.0005346001,0.0000786089,0.000287377,0.00002241011,0.000001297761,0.00001621864,0.005924305,0.9279112,0.00003592092,0.0005059597,0.06454507,0.0001370523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000401086,0.00009048195,0.9836583,0.0006821085,0.0002809052,0.002382726,0.00005529689,0.00008204168,0.01236709],"genre_scores_gemma":[0.7959529,0.0000851853,0.1897548,0.0005521378,0.0002902208,0.01027627,0.0002173494,0.00003237857,0.002838774],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7955518,"threshold_uncertainty_score":0.9985908,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04901622433517749,"score_gpt":0.3374266635117765,"score_spread":0.288410439176599,"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."}}