{"id":"W4393307376","doi":"10.1287/ijoc.2023.0128","title":"Computing Bipath Multicommodity Flows with Constraint Programming–Based Branch-and-Price-and-Cut","year":2024,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Branch and cut; Mathematical optimization; Branch and price; Constraint programming; Branch and bound; Constraint (computer-aided design); Computer science; Integer programming; Mathematics; Operations research; Stochastic programming","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true,"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.0005719377,0.0002514012,0.0002530375,0.00024493,0.0002945756,0.0007990379,0.000111757,0.00008574867,0.000009450685],"category_scores_gemma":[0.00005691062,0.000186352,0.00006304307,0.0002667669,0.00006947893,0.000214227,0.00003770078,0.0008018482,0.00001005563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007907597,"about_ca_system_score_gemma":0.00006582877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003235354,"about_ca_topic_score_gemma":0.00000168109,"domain_scores_codex":[0.9987193,0.00001877851,0.0004387059,0.0001759816,0.0002681254,0.000379123],"domain_scores_gemma":[0.9992204,0.0002812875,0.00007855672,0.0001054377,0.00008851851,0.0002257401],"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.000009136761,0.0000116313,0.0005914011,0.0001165309,0.00006124169,0.00005112625,0.0006767433,0.6402014,0.00001289737,0.0001652193,0.00001281057,0.3580898],"study_design_scores_gemma":[0.0006838783,0.0001185225,0.0005372592,0.0008047105,0.00002083859,0.000578795,0.0001357675,0.9956892,0.0001322623,0.0000236854,0.001004664,0.000270379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4464526,0.0003371814,0.5514575,0.00011382,0.0005663192,0.0001240069,0.00000225791,0.0005355249,0.0004108592],"genre_scores_gemma":[0.8489315,0.00001830388,0.1505808,0.0001388461,0.0002858063,9.231356e-7,0.000003785321,0.00003588218,0.000004142936],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4024789,"threshold_uncertainty_score":0.7705141,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01227977936106625,"score_gpt":0.2384403833284529,"score_spread":0.2261606039673866,"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."}}