Lagrangean methods for the 0-1 quadratic knapsack problem
From MaRDI portal
Publication:1268265
Recommendations
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- A new upper bound for the 0-1 quadratic knapsack problem
- Lagrangean methods for 0-1 quadratic problems
- Decomposition and linearization for 0-1 quadratic programming
- Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem
Cites work
- A Fast Parametric Maximum Flow Algorithm and Applications
- scientific article; zbMATH DE number 4112385 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Lagrangean methods for 0-1 quadratic problems
- Methods of Nonlinear 0-1 Programming
- Minimum cuts and related problems
- On the supermodular knapsack problem
- Quadratic knapsack problems
Cited in
(35)- A Lagrangian dual and surrogate method for multi-dimensional quadratic knapsack problems
- The nonlinear knapsack problem - algorithms and applications
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
- A computational study on the quadratic knapsack problem with multiple constraints
- Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem
- Lagrangean methods for 0-1 quadratic problems
- A new upper bound for the 0-1 quadratic knapsack problem
- The quadratic 0-1 knapsack problem with series-parallel support
- Parametric convex quadratic relaxation of the quadratic knapsack problem
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- Allocation of advertising space by a web service provider using combinatorial auctions
- 0-1 quadratic knapsack problem solved with VNS algorithm
- On a nonseparable convex maximization problem with continuous Knapsack constraints
- A note on semidefinite relaxation for 0-1 quadratic knapsack problems
- A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem
- A dynamic programming heuristic for the quadratic knapsack problem
- Generalized quadratic multiple knapsack problem and two solution approaches
- A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem
- scientific article; zbMATH DE number 1501879 (Why is no real title available?)
- A two-phase method for solving continuous rank-one quadratic knapsack problems
- A branch-and-bound algorithm for multi-dimensional quadratic 0–1 knapsack problems
- Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1
- Decomposition and linearization for 0-1 quadratic programming
- Lagrangian heuristics for the quadratic knapsack problem
- 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
- Global optimality conditions and optimization methods for quadratic knapsack problems
- On reduction of duality gap in quadratic knapsack problems
- The quadratic knapsack problem
- Simple solution methods for separable mixed linear and quadratic knapsack problem
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
- The quadratic knapsack problem -- a survey
- A Newton's method for the continuous quadratic knapsack problem
This page was built for publication: Lagrangean methods for the 0-1 quadratic knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1268265)
