{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002498216,0.001429116,0.001607025,0.00112514,0.0007269044,0.00173239,0.002371296,0.001733195,0.01277348],"category_scores_gemma":[0.00884157,0.000889109,0.001107194,0.002972861,0.0007759946,0.002111061,0.001945668,0.002659932,0.001359859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001210297,"about_ca_system_score_gemma":0.002945293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01435725,"about_ca_topic_score_gemma":0.01297794,"domain_scores_codex":[0.9990018,0.0003052712,0.00004569917,0.0001101817,0.0004429368,0.00009409199],"domain_scores_gemma":[0.9966415,0.002164544,0.0001444886,0.0002427477,0.0006888226,0.0001179092],"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.00005764779,0.0001049845,0.0001805803,0.0001467184,0.00003864543,0.0001001316,0.00004323487,0.8668613,0.0006560219,0.02926165,0.004168845,0.09838021],"study_design_scores_gemma":[0.00001227003,0.00001088652,0.00002322567,0.00000776283,0.000004349203,0.00001372532,0.0000055614,0.9932218,0.0001113591,0.005817772,0.0007666122,0.000004720997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002274459,0.0001928415,0.9927012,0.0001454015,0.00008042557,0.00008175117,0.00008088601,0.0002240746,0.004218854],"genre_scores_gemma":[0.08274314,0.0003698262,0.9106433,0.0002105441,0.00009494962,0.0003224225,0.0002423971,0.00035586,0.005017666],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01435725,"threshold_uncertainty_score":0.04273158,"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."}}