{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008616303,0.0002964392,0.0002588412,0.0002517076,0.0009490373,0.0003140884,0.0007150038,0.00009159956,0.00000197072],"category_scores_gemma":[0.000118087,0.000216262,0.00009838046,0.0006741162,0.00004949949,0.0009702294,0.0002106818,0.0003759138,0.00001296064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002035273,"about_ca_system_score_gemma":0.00009582853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001339523,"about_ca_topic_score_gemma":0.000005717574,"domain_scores_codex":[0.9979615,0.00005525123,0.0006918731,0.0004640875,0.0003489106,0.0004783631],"domain_scores_gemma":[0.997919,0.0001924039,0.0006152635,0.0003329401,0.0007318134,0.0002085416],"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.000009338959,0.00004108917,0.00001659084,0.000006706164,0.000021054,7.515159e-7,0.004278943,0.553655,0.0000263778,0.0005286225,0.000007641363,0.4414079],"study_design_scores_gemma":[0.00114323,0.0002895973,0.0003854059,0.00008480637,0.00001130517,0.0001541246,0.0001629932,0.9956018,0.0006167229,0.0007832971,0.0004644047,0.0003023074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003816835,0.00004218022,0.9968027,0.0002129843,0.0003380296,0.001680812,0.000004748383,0.0001716401,0.0003651967],"genre_scores_gemma":[0.0604924,0.00002800813,0.9382533,0.0007864576,0.0002518544,0.0001102961,0.000005418818,0.00003566276,0.0000365858],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4419468,"threshold_uncertainty_score":0.8818908,"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."}}