Exploiting nested inequalities and surrogate constraints

DOI10.1016/J.EJOR.2006.03.046MaRDI QIDQ858413zbMATH OpenOpenAlexFDO

Authors Saïd Hanafi, Fred Glover

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

zbMATH Keywords

integer programmingmultidimensional knapsack problemsurrogate constraintsnested cuts

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Integer programming (90C10)

Recommendations

• Surrogate Constraints in Integer Programming
• scientific article; zbMATH DE number 176468
• On an optimization problem with nested constraints
• Constraint Generation and Surrogate Relaxation
• Artificial Intelligence: Methodology, Systems, and Applications
• scientific article; zbMATH DE number 3982927
• scientific article; zbMATH DE number 3963578
• scientific article; zbMATH DE number 3909181
• Implicit constraints handling for efficient search of feasible solutions

Cites work

• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
• An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
• Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
• Faces for a linear inequality in 0–1 variables
• Facet of regular 0–1 polytopes
• Facets of the knapsack polytope
• Flows in Arborescences
• Solving Large-Scale Zero-One Linear Programming Problems
• Surrogate Constraints
• Surrogate Dual Multiplier Search Procedures in Integer Programming
• Surrogate Mathematical Programming
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• The multidimensional 0-1 knapsack problem: an overview.

Cited in

(8)

• Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
• Second-order cover inequalities
• Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities
• An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
• Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
• Optimization algorithms for the disjunctively constrained knapsack problem
• New convergent heuristics for 0-1 mixed integer programming
• Constraint Generation and Surrogate Relaxation

This page was built for publication: Exploiting nested inequalities and surrogate constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858413)