Technical Note—Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations
From MaRDI portal
Publication:4648257
DOI10.1287/opre.1120.1049zbMath1260.90040OpenAlexW2156698143MaRDI QIDQ4648257
Chungmok Lee, Kyungchul Park, Kyungsik Lee, Sungsoo Park
Publication date: 8 November 2012
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1120.1049
integer programmingrobust optimizationnetwork design problemrobust knapsack problembranch-and-price-and-cut
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)
Related Items (13)
Robust optimization approach for a chance-constrained binary knapsack problem ⋮ Robust combinatorial optimization with variable cost uncertainty ⋮ Robust Network Design with Uncertain Outsourcing Cost ⋮ Exact solution of the robust knapsack problem ⋮ Telecommunications network design: Technology impacts and future directions ⋮ Comparative analysis of linear programming relaxations for the robust knapsack problem ⋮ Robust balanced optimization ⋮ The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach ⋮ Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty ⋮ A branch and price approach for the robust bandwidth packing problem with queuing delays ⋮ Robust drone selective routing in humanitarian transportation network assessment ⋮ Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty ⋮ Exact approaches for solving robust prize-collecting Steiner tree problems
This page was built for publication: Technical Note—Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations
