Approximate extended formulations
From MaRDI portal
Publication:2583138
Recommendations
Cites work
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A primal all-integer algorithm based on irreducible solutions
- A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. (Abstract of thesis)
- An analytical comparison of different formulations of the travelling salesman problem
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Disjunctive Programming
- scientific article; zbMATH DE number 3568353 (Why is no real title available?)
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- Integer Programming Formulation of Traveling Salesman Problems
- Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity
- Polyhedra for lot-sizing with Wagner-Whitin costs
- Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation
- Strong formulations for mixed integer programs: valid inequalities and extended formulations
- Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems
- Uncapacitated lot-sizing: The convex hull of solutions
Cited in
(40)- Multi-item lot-sizing with joint set-up costs
- Uncapacitated lot sizing with backlogging: the convex hull
- Stochastic lot sizing problem with nervousness considerations
- Combined ship routing and inventory management in the salmon farming industry
- Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case
- MIP formulations and heuristics for two-level production-transportation problems
- On the existence of compact $\varepsilon$-approximated formulations for knapsack in the original space
- Robust formulations for economic lot-sizing problem with remanufacturing
- Lower bound on size of branch-and-bound trees for solving lot-sizing problem
- Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure
- Balas formulation for the union of polytopes is optimal
- Efficient reformulations for dynamic lot-sizing problems with product substitution
- Fixed-charge transportation on a path: optimization, LP formulations and separation
- Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem
- Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection
- Extended variational formulation
- Mixed integer linear programming formulation techniques
- A horizon decomposition approach for the capacitated lot-sizing problem with setup times
- Column generation for extended formulations
- Local cuts and two-period convex hull closures for big-bucket lot-sizing problems
- LS-LIB: a library of tools for solving production planning problems
- Fixed-charge transportation on a path: linear programming formulations
- Cuts over extended formulations by flow discretization
- Approximation Limits of Linear Programs (Beyond Hierarchies)
- Period decompositions for the capacitated lot sizing problem with setup times
- Relaxations for two-level multi-item lot-sizing problems
- Tightening simple mixed-integer sets with guaranteed bounds
- Strong and compact relaxations in the original space using a compact extended formulation
- Column generation for extended formulations
- Natural and extended formulations for the time-dependent traveling salesman problem
- Extended cuscuton: formulation
- Extended formulations in combinatorial optimization
- Extended formulations in combinatorial optimization
- New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem
- Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
- Knapsack polytopes: a survey
- Compact formulations as a union of polyhedra
- Approximate formulations for 0-1 knapsack sets
- A heuristic approach for big bucket multi-level production planning problems
- Uncapacitated two-level lot-sizing
This page was built for publication: Approximate extended formulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583138)
