Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
From MaRDI portal
Publication:2899064
DOI10.1287/ijoc.1090.0348zbMath1243.90031OpenAlexW2117768313MaRDI QIDQ2899064
Mike Hewitt, Savelsbergh, Martin W. P., Nemhauser, George I.
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/883888ae8e446a771d6ff5a381b0a4b3d956ea3d
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items
The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design, Consolidating home meal delivery with limited operational disruption, A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem, Minimum-Cost Network Design with (Dis)economies of Scale, The synchronized arc and node routing problem: application to road marking, Heuristics for dynamic and stochastic inventory-routing, A hybrid method for the probabilistic maximal covering location-allocation problem, A parallel local search framework for the fixed-charge multicommodity network flow problem, Combined column-and-row-generation for the optimal communication spanning tree problem, A cutting plane algorithm for the capacitated connected facility location problem, The transit time constrained fixed charge multi-commodity network design problem, Minimum‐cost flow problems having arc‐activation costs, Avoiding unnecessary demerging and remerging of multi‐commodity integer flows, Computational risk management techniques for fixed charge network flow problems with uncertain arc failures, Service network design models for two-tier city logistics, LP Formulations for Polynomial Optimization Problems, MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem, Approximability of Capacitated Network Design, Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs, Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design, The inventory-routing problem with transshipment, Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design, Decomposing inventory routing problems with approximate value functions, Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design, Scheduling of maintenance windows in a mining supply chain rail network, Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion, Restrict-and-relax search for 0-1 mixed-integer programs, A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts, Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design, Directed fixed charge multicommodity network design: a cutting plane approach using polar duality, Scheduled Service Network Design for Freight Rail Transportation, Approximability of capacitated network design
