Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
From MaRDI portal
Publication:817207
DOI10.1007/s10479-005-3972-6zbMath1091.90049OpenAlexW2042133378MaRDI QIDQ817207
Publication date: 7 March 2006
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-005-3972-6
convex hullvalid inequalitiescapacitated lot-sizingreformulation-linearization techniquedynamic fixed-charge problems
Related Items
Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder, Global optimality conditions for fixed charge quadratic programs, Minimum‐cost flow problems having arc‐activation costs, Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities, The impact of distribution system characteristics on computational tractability
Cites Work
- Unnamed Item
- Unnamed Item
- The telephonic switching centre network problem: Formalization and computational experience
- Valid inequalities and separation for capacitated economic lot sizing
- Submodularity and valid inequalities in capacitated fixed charge networks
- Optimization with disjunctive constraints
- Solving to optimality the uncapacitated fixed-charge network flow problem
- Disjunctive programming: Properties of the convex hull of feasible points
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- Optimization by ghost image processes in neural networks
- Dynamic knapsack sets and capacitated lot-sizing
- A tabu search heuristic procedure for the fixed charge transportation problem
- A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
- Valid inequalities and separation for capacitated fixed charge flow problems
- Lot-sizing with fixed charges on stocks: the convex hull
- Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Some branch-and-bound procedures for fixed-cost transportation problems
- Uncapacitated lot-sizing: The convex hull of solutions
- Solving large-scale mixed-integer programs with fixed charge variables
- Valid Linear Inequalities for Fixed Charge Problems
- Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
- Tailoring Benders decomposition for uncapacitated network design
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Analysis of a flow problem with fixed charges
- Set Partitioning: A survey
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Disjunctive Programming
- Network Design Using Cut Inequalities
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
