{"id":"W1428828117","doi":"10.1016/j.ejor.2015.06.073","title":"The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":69,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Column generation; Mathematical optimization; Pairwise comparison; Vehicle routing problem; Purchasing; Computer science; Branch and bound; Scheduling (production processes); Traveling purchaser problem; Shortest path problem; Branch and price; Branch and cut; Integer programming; Graph; Operations research; Routing (electronic design automation); Mathematics; Combinatorial optimization; 2-opt; Economics","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.01280347,0.0001089579,0.0001418202,0.00009333423,0.0003134718,0.0002116558,0.0002022014,0.00002134224,0.000006456668],"category_scores_gemma":[0.0007514131,0.00007080723,0.00001911974,0.0002528304,0.0003685008,0.0002604992,0.000074993,0.0006213302,0.000003105387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006124356,"about_ca_system_score_gemma":0.0001771026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003146289,"about_ca_topic_score_gemma":0.000002599839,"domain_scores_codex":[0.997067,0.00153563,0.0004004412,0.000141991,0.0006182081,0.0002367309],"domain_scores_gemma":[0.9981752,0.0004730907,0.00005430003,0.0001303532,0.0008999282,0.0002671436],"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.000412997,0.0001965793,0.02497873,0.0001556285,0.0002234096,0.0001091906,0.008634395,0.9092954,0.002865362,0.001359562,0.0006865383,0.05108225],"study_design_scores_gemma":[0.003596615,0.0004511144,0.0381997,0.0001464855,0.00001568301,0.0005014853,0.002246292,0.9529485,0.0003676711,0.0001481138,0.001139156,0.0002392263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7055373,0.0009521126,0.2890606,0.0006477489,0.00003555828,0.0002886976,0.000004798665,0.0000285568,0.003444635],"genre_scores_gemma":[0.8393401,0.00007439858,0.1603931,0.00002098477,0.0000838201,0.000002455747,0.000002130121,0.00002676635,0.00005622526],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1338028,"threshold_uncertainty_score":0.4437452,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1067445357993932,"score_gpt":0.3311792832241026,"score_spread":0.2244347474247094,"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."}}