Exploiting nested inequalities and surrogate constraints
From MaRDI portal
Publication:858413
DOI10.1016/j.ejor.2006.03.046zbMath1275.90040OpenAlexW1989593435MaRDI QIDQ858413
Publication date: 9 January 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.03.046
Related Items (7)
New convergent heuristics for 0-1 mixed integer programming ⋮ Second-order cover inequalities ⋮ Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities ⋮ Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem ⋮ Optimization algorithms for the disjunctively constrained knapsack problem ⋮ An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem ⋮ Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
Cites Work
- Unnamed Item
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
- The multidimensional 0-1 knapsack problem: an overview.
- Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
- Surrogate Dual Multiplier Search Procedures in Integer Programming
- Solving Large-Scale Zero-One Linear Programming Problems
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Surrogate Constraints
- Flows in Arborescences
- Surrogate Mathematical Programming
This page was built for publication: Exploiting nested inequalities and surrogate constraints
