Lagrangean methods for the 0-1 quadratic knapsack problem
From MaRDI portal
Publication:1268265
DOI10.1016/0377-2217(94)00286-XzbMath0912.90222WikidataQ126773919 ScholiaQ126773919MaRDI QIDQ1268265
Louis Veilleux, Philippe Yves Paul Michelon
Publication date: 18 October 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items
0-1 quadratic knapsack problem solved with VNS algorithm, Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs, On a nonseparable convex maximization problem with continuous Knapsack constraints, Generalized quadratic multiple knapsack problem and two solution approaches, A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem, The quadratic knapsack problem -- a survey, Solution of a Facility Layout Problem in a Final Assembly Workshop using Constraint Programming, A general purpose exact solution method for mixed integer concave minimization problems, A Dynamic Programming Heuristic for the Quadratic Knapsack Problem, Global optimality conditions and optimization methods for quadratic knapsack problems, On reduction of duality gap in quadratic knapsack problems, Simple solution methods for separable mixed linear and quadratic knapsack problem, A computational study on the quadratic knapsack problem with multiple constraints, Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem, An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem, Upper bounds and exact algorithms for \(p\)-dispersion problems, A branch-and-bound algorithm for multi-dimensional quadratic 0–1 knapsack problems, Lagrangian heuristics for the quadratic knapsack problem, A new upper bound for the 0-1 quadratic knapsack problem, Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1, Parametric convex quadratic relaxation of the quadratic knapsack problem, Allocation of advertising space by a web service provider using combinatorial auctions, A note on semidefinite relaxation for 0-1 quadratic knapsack problems, The nonlinear knapsack problem - algorithms and applications, The quadratic 0-1 knapsack problem with series-parallel support
Cites Work
- Unnamed Item
- Unnamed Item
- Lagrangean methods for 0-1 quadratic problems
- On the supermodular knapsack problem
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Methods of Nonlinear 0-1 Programming
- Quadratic knapsack problems
- Minimum cuts and related problems
- A Fast Parametric Maximum Flow Algorithm and Applications
