{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008672445,0.00009305306,0.0001523479,0.0002087681,0.0001482431,0.0002426093,0.0002340468,0.00002426841,0.00004914904],"category_scores_gemma":[0.0003118375,0.00008464188,0.00004568876,0.0001939293,0.00002978981,0.000463726,0.00004565328,0.0004182332,0.00003505148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006058115,"about_ca_system_score_gemma":0.00009616907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.371955e-7,"about_ca_topic_score_gemma":4.288792e-7,"domain_scores_codex":[0.9979395,0.0007216358,0.000416642,0.000133304,0.0005272799,0.0002615913],"domain_scores_gemma":[0.9984779,0.0003698225,0.0000545675,0.0001169014,0.0008327547,0.0001480901],"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.00006817467,0.00009248377,0.001154548,0.000124313,0.0001435357,0.00003058146,0.001801609,0.507286,0.07545591,0.003708179,0.002527555,0.4076072],"study_design_scores_gemma":[0.001134843,0.0005950927,0.002643344,0.0001022858,0.000006242617,0.0001281141,0.0001402566,0.9876724,0.002323963,0.0001202557,0.004979009,0.0001542137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2193496,0.000185931,0.7666537,0.0003312127,0.0002333927,0.0004218193,0.000009880107,0.00004680479,0.01276773],"genre_scores_gemma":[0.6000786,0.00003030988,0.3988651,0.00003463484,0.0004203713,0.000002597352,0.000005880326,0.00005561412,0.0005068888],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4803864,"threshold_uncertainty_score":0.3451596,"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."}}