Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
From MaRDI portal
Publication:2899064
DOI10.1287/ijoc.1090.0348zbMath1243.90031MaRDI 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
90C10: Integer programming
90C59: Approximation methods and heuristics in mathematical programming
90B10: Deterministic network models in operations research
Related Items
LP Formulations for Polynomial Optimization Problems, MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem, Minimum‐cost flow problems having arc‐activation costs, Consolidating home meal delivery with limited operational disruption, A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem, 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, Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs, Restrict-and-relax search for 0-1 mixed-integer programs, The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design, 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, Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design, The inventory-routing problem with transshipment, Computational risk management techniques for fixed charge network flow problems with uncertain arc failures, Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design, Directed fixed charge multicommodity network design: a cutting plane approach using polar duality, Exact algorithms based on Benders decomposition for multicommodity uncapacitated 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, A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts, Approximability of capacitated network design, A cutting plane algorithm for the capacitated connected facility location problem, Service network design models for two-tier city logistics, Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design, The transit time constrained fixed charge multi-commodity network design problem, Scheduled Service Network Design for Freight Rail Transportation, Approximability of Capacitated Network Design, Decomposing inventory routing problems with approximate value functions, Minimum-Cost Network Design with (Dis)economies of Scale
