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.90051MaRDI QIDQ1319550
Ronald L. Rardin, Laurence A. Wolsey
Publication date: 5 May 1994
Published in: European Journal of Operational Research (Search for Journal in Brave)
linear inequalities; lot sizing; multicommodity extended formulation; uncapacitated fixed charge networks flow problem
Related Items
Unnamed Item, Multiechelon Lot Sizing: New Complexities and Inequalities, Benders decomposition approach for the robust network design problem with flow bifurcations, Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem, On reformulations for the one-warehouse multi-retailer problem, Strong and compact relaxations in the original space using a compact extended formulation, A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems, Cutting planes in integer and mixed integer programming, A heuristic approach for big bucket multi-level production planning problems, Using separation algorithms to generate mixed integer model reformulations, Solving to optimality the uncapacitated fixed-charge network flow problem, Minimum cost capacity installation for multicommodity network flows, Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials, Long range planning in the process industries: A projection approach, A computational analysis of lower bounds for big bucket production planning problems, ``Facet separation with one linear program, The minimum flow cost Hamiltonian cycle problem: a comparison of formulations, Optimization models for forest road upgrade planning, Lot sizing with inventory gains, Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems, Projecting the flow variables for hub location problems
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
