{"id":"W2903252607","doi":"10.1016/j.ejor.2019.10.007","title":"A branch-and-cut algorithm for an assembly routing problem","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"HEC Montréal","keywords":"Branch and cut; Linear programming relaxation; Integer programming; Context (archaeology); Mathematical optimization; Routing (electronic design automation); Set (abstract data type); Linear programming; Algorithm; Production planning; Production (economics); Relaxation (psychology); Computer science; Lagrangian relaxation; Product (mathematics); Integer (computer science); Column generation; Mathematics; Programming language","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.001211136,0.0014844,0.001709924,0.001333116,0.001141019,0.001469826,0.001685044,0.002728389,0.009761672],"category_scores_gemma":[0.003032835,0.001064849,0.001091563,0.001889198,0.0007306517,0.001504175,0.001451046,0.002428338,0.001198056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001064665,"about_ca_system_score_gemma":0.002327518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007438776,"about_ca_topic_score_gemma":0.006905454,"domain_scores_codex":[0.999503,0.0001473151,0.00002112587,0.0000891071,0.0001614617,0.00007796104],"domain_scores_gemma":[0.9986609,0.00095453,0.00005978092,0.00005610244,0.0001841633,0.00008447635],"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.0002356367,0.0002609568,0.0004234097,0.0001953956,0.00005343763,0.0001014295,0.00008952542,0.7382346,0.002689425,0.01468483,0.006566964,0.2364644],"study_design_scores_gemma":[0.00004579263,0.00005647574,0.0000739144,0.0000119879,0.00001319111,0.00001932793,0.00001410136,0.9933057,0.000329906,0.005093903,0.001029691,0.000006008203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01128813,0.0002578189,0.9818758,0.000297077,0.00009344673,0.0001481079,0.0001208282,0.0005167422,0.005402006],"genre_scores_gemma":[0.07194856,0.0002665338,0.9222714,0.0001077465,0.00006866638,0.000326517,0.000344273,0.0001978697,0.004468475],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009761672,"threshold_uncertainty_score":0.03265601,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07423329463476477,"score_gpt":0.3703136885316752,"score_spread":0.2960803938969104,"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."}}