An evaluation of semidefinite programming based approaches for discrete lot-sizing problems
From MaRDI portal
Publication:2514881
DOI10.1016/j.ejor.2014.02.027zbMath1304.90010OpenAlexW1973923112MaRDI QIDQ2514881
Celine Gicquel, Abdel Lisser, Michel Minoux
Publication date: 4 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.02.027
manufacturingcutting planessemidefinite relaxationdiscrete lot-sizing and scheduling problemquadratically constrained quadratic binary programmingsequence-dependent changeover costs and times
Related Items
Uses Software
Cites Work
- The discrete lot-sizing and scheduling problem
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times
- Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows
- On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs
- Semidefinite programming relaxations for the quadratic assignment problem
- A semidefinite programming approach to the quadratic knapsack problem
- Semidefinite programming
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
- Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- Dynamic Version of the Economic Lot Size Model
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
- Latest Developments in the SDPA Family for Solving Large-Scale SDPs
- Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources
- Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
- Convex quadratic and semidefinite programming relaxations in scheduling
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A Spectral Bundle Method for Semidefinite Programming
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Modeling industrial lot sizing problems: a review
- Production Planning by Mixed Integer Programming
- Semidefinite relaxations for partitioning, assignment and ordering problems
