{"id":"W2101083806","doi":"10.1287/ijoc.1110.0476","title":"A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem","year":2011,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"Ministère de l'Education Nationale, de l'Enseignement Superieur et de la Recherche","keywords":"Travelling salesman problem; Branch and cut; 2-opt; Bottleneck traveling salesman problem; Branch and bound; Mathematical optimization; Mathematics; Maximum cut; Algorithm; Traveling purchaser problem; Constraint (computer-aided design); Hamiltonian path; Computer science; Integer programming; Combinatorics; Graph","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.001438468,0.001204617,0.001313322,0.0009365415,0.0009834386,0.000989633,0.001748631,0.001700846,0.004179901],"category_scores_gemma":[0.002918072,0.000498187,0.001065929,0.001896117,0.0007095213,0.001374049,0.001582786,0.002218184,0.0009498313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001114818,"about_ca_system_score_gemma":0.001543812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002638255,"about_ca_topic_score_gemma":0.004116727,"domain_scores_codex":[0.999201,0.0002480973,0.00003910994,0.0001497794,0.0002704148,0.00009171264],"domain_scores_gemma":[0.9992405,0.0003839517,0.00007712044,0.00009142354,0.0001580692,0.00004902041],"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.00007141533,0.0000893805,0.0003370146,0.0002649282,0.00005540983,0.0001339914,0.0001007579,0.607971,0.002587661,0.06200809,0.005395243,0.320985],"study_design_scores_gemma":[0.00002748171,0.00003588549,0.00008228501,0.0000222511,0.00001458713,0.00007603474,0.00001532518,0.9633011,0.0008566881,0.02927725,0.006278807,0.00001229195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001380712,0.0001112306,0.9966749,0.00006584515,0.00001792534,0.0000421589,0.0000286691,0.000160513,0.001518144],"genre_scores_gemma":[0.02379762,0.0002193386,0.9745009,0.00006570087,0.00002399376,0.0001571624,0.0001093637,0.0001114912,0.001014489],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004179901,"threshold_uncertainty_score":0.01398313,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02545219489268772,"score_gpt":0.262219071653721,"score_spread":0.2367668767610333,"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."}}