{"id":"W4205537357","doi":"10.1016/j.ejor.2021.12.050","title":"A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Transport Canada","funders":"Shanghai Jiao Tong University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Compute Canada; Polytechnique Montréal","keywords":"Vehicle routing problem; Branch and cut; Computer science; Mathematical optimization; Routing (electronic design automation); Integer programming; Branch and bound; Algorithm; Mathematics; Computer network","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.009783415,0.00009663709,0.0001277729,0.0001513029,0.0009687216,0.000166941,0.0002659944,0.000008610956,0.0001677355],"category_scores_gemma":[0.0002372604,0.00007039735,0.00004366739,0.0002984133,0.0001529485,0.0001655845,0.0001244602,0.0007250042,0.000004067162],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001097652,"about_ca_system_score_gemma":0.000176758,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001559476,"about_ca_topic_score_gemma":4.556616e-7,"domain_scores_codex":[0.9974604,0.000908238,0.0003784914,0.0001299513,0.0008483347,0.0002745307],"domain_scores_gemma":[0.9980571,0.001119716,0.00007189066,0.0000966825,0.0005554918,0.00009917991],"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.00004188344,0.00001967648,0.0001423156,0.000009001773,0.0000817472,0.00003872908,0.0005082809,0.9256015,0.00445495,0.0008021154,0.0007214073,0.06757835],"study_design_scores_gemma":[0.001638042,0.0003319413,0.0007843539,0.00005061842,0.0000137087,0.0006782102,0.0003731592,0.9931034,0.0007326948,0.00007418414,0.002097519,0.0001221559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1338608,0.0007633616,0.8564956,0.00299509,0.0003260688,0.0008544321,0.00005611802,0.00006749795,0.004581019],"genre_scores_gemma":[0.82838,0.000007822722,0.1710035,0.00008878149,0.0002725915,0.00001360337,0.000004340804,0.00004703346,0.0001822422],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6945193,"threshold_uncertainty_score":0.7450721,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05341610305665129,"score_gpt":0.3333075957489059,"score_spread":0.2798914926922546,"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."}}