{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001477954,0.001847001,0.001531987,0.001408659,0.001078798,0.002859943,0.002456486,0.001953635,0.00755224],"category_scores_gemma":[0.005484893,0.001031011,0.001524585,0.002622153,0.0009655812,0.002214822,0.001728782,0.002365691,0.001338144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001786545,"about_ca_system_score_gemma":0.003680007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01530828,"about_ca_topic_score_gemma":0.01727266,"domain_scores_codex":[0.9990135,0.0002728221,0.00004542691,0.0002224939,0.0002793838,0.0001664026],"domain_scores_gemma":[0.9979195,0.001302268,0.0001591676,0.0001772217,0.0003055419,0.0001363441],"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.00005729538,0.000087221,0.000460077,0.0001401115,0.00004823632,0.00008335968,0.00004991848,0.9287871,0.0009250304,0.01457484,0.00409732,0.05068953],"study_design_scores_gemma":[0.00001261481,0.00001169884,0.00003032715,0.000006813734,0.000005142619,0.00001013677,0.00001138712,0.9915275,0.0002621953,0.007394233,0.0007238289,0.000004192367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01357914,0.0002672067,0.9789834,0.0003573777,0.00006443761,0.0001573088,0.0003847446,0.001082329,0.0051241],"genre_scores_gemma":[0.101485,0.0002857159,0.8941969,0.0001638882,0.00005183532,0.0003335296,0.0009400577,0.000356123,0.002186897],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01530828,"threshold_uncertainty_score":0.03043836,"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."}}