{"id":"W1980201624","doi":"10.1016/j.ejor.2007.12.014","title":"An exact -constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":363,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Travelling salesman problem; Mathematical optimization; Heuristics; Combinatorial optimization; 2-opt; Traveling purchaser problem; Vertex (graph theory); Mathematics; Multi-objective optimization; Bottleneck traveling salesman problem; Pareto principle; Constraint (computer-aided design); Computer science; Combinatorics; Graph","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01492814,0.0001765566,0.0001913814,0.0003914631,0.0007112113,0.0004440792,0.001108603,0.00003462703,0.000006011826],"category_scores_gemma":[0.0005508286,0.0001208409,0.00005584349,0.001128583,0.0001059752,0.001090053,0.0001049645,0.0005120307,0.000009254066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002619879,"about_ca_system_score_gemma":0.000519883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004599754,"about_ca_topic_score_gemma":0.000006966969,"domain_scores_codex":[0.9960355,0.001220958,0.0006619585,0.0004551595,0.001204018,0.0004223991],"domain_scores_gemma":[0.9932691,0.0006651412,0.0003016389,0.0003549041,0.005140606,0.0002686247],"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.000212337,0.0001767554,0.00002817423,0.000009210233,0.00003494711,0.00001247093,0.002242816,0.9271317,0.003033038,0.02608404,0.00004688592,0.04098758],"study_design_scores_gemma":[0.002690071,0.003175122,0.001223171,0.0001077121,0.00001229931,0.0002494241,0.0007253129,0.9819117,0.005740713,0.001044837,0.002808039,0.0003116186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003513339,0.00001975306,0.99471,0.001582518,0.0001503182,0.001971449,0.000006757812,0.00003139704,0.001176505],"genre_scores_gemma":[0.165919,0.000005658586,0.8333071,0.0001225777,0.0004922317,0.0000539005,0.00001267677,0.00003723047,0.00004962219],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1655676,"threshold_uncertainty_score":0.5470134,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04206008863009993,"score_gpt":0.3738648753142147,"score_spread":0.3318047866841148,"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."}}