Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
From MaRDI portal
Publication:1319550
DOI10.1016/0377-2217(93)90263-MzbMath0807.90051OpenAlexW2039342074MaRDI QIDQ1319550
Ronald L. Rardin, Laurence A. Wolsey
Publication date: 5 May 1994
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(93)90263-m
linear inequalitieslot sizingmulticommodity extended formulationuncapacitated fixed charge networks flow problem
Related Items
On reformulations for the one-warehouse multi-retailer problem, Projecting the flow variables for hub location problems, Optimization models for forest road upgrade planning, Benders decomposition approach for the robust network design problem with flow bifurcations, Long range planning in the process industries: A projection approach, Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection, New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem, Discrete equal-capacityp-median problem, A computational analysis of lower bounds for big bucket production planning problems, Minimum‐cost flow problems having arc‐activation costs, Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem, Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems, Strong and compact relaxations in the original space using a compact extended formulation, Multiechelon Lot Sizing: New Complexities and Inequalities, Using separation algorithms to generate mixed integer model reformulations, Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials, Lot sizing with inventory gains, Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure, A heuristic approach for big bucket multi-level production planning problems, A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems, Cutting planes in integer and mixed integer programming, Solving to optimality the uncapacitated fixed-charge network flow problem, Directed fixed charge multicommodity network design: a cutting plane approach using polar duality, Minimum cost capacity installation for multicommodity network flows, ``Facet separation with one linear program, The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
Cites Work
- Valid inequalities and separation for uncapacitated fixed charge networks
- Packing and covering a tree by subtrees
- Lot-size models with backlogging: Strong reformulations and cutting planes
- Using separation algorithms to generate mixed integer model reformulations
- Uncapacitated lot-sizing: The convex hull of solutions
- Uncapacitated Lot-Sizing Problems with Start-Up Costs
- A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
