Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
From MaRDI portal
Publication:1861918
DOI10.1023/A:1021513321301zbMath1028.90042MaRDI QIDQ1861918
Fred Glover, Peter L. Hammer, Maria A. Osorio
Publication date: 10 March 2003
Published in: Annals of Operations Research (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
Problems of discrete optimization: challenges and main approaches to solve them, New convergent heuristics for 0-1 mixed integer programming, Exploiting nested inequalities and surrogate constraints, A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem, Global optimization and multi knapsack: a percolation algorithm., The multidimensional 0-1 knapsack problem: an overview., Second-order cover inequalities, Preprocessing for a map sectorization problem by means of mathematical programming, A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem, Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities, A new variable reduction technique for convex integer quadratic programs, Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem, Improved results on the 0--1 multidimensional knapsack problem, A dual heuristic for mixed integer programming, A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem, Simple and fast surrogate constraint heuristics for the maximum independent set problem, A trust branching path heuristic for zero-one programming, An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem, Heuristics for the 0-1 multidimensional knapsack problem, Revisiting surrogate relaxation for the multidimensional knapsack problem, A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems, Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems, The multidimensional 0-1 knapsack problem -- bounds and computational aspects
Uses Software
