An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
From MaRDI portal
(Redirected from Publication:703909)
Recommendations
- A new upper bound for the 0-1 quadratic knapsack problem
- Lagrangean methods for the 0-1 quadratic knapsack problem
- 0-1 quadratic knapsack problems: an exact approach based on a \(t\)-linearization
- Exact solution methods for the \(k\)-item quadratic knapsack problem
- Linear programming for the \(0-1\) quadratic knapsack problem
Cites work
- scientific article; zbMATH DE number 4112385 (Why is no real title available?)
- A Decomposition Method for Quadratic Zero-One Programming
- A new upper bound for the 0-1 quadratic knapsack problem
- Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
- Exact Solution of the Quadratic Knapsack Problem
- Lagrangean methods for the 0-1 quadratic knapsack problem
- Linear programming for the \(0-1\) quadratic knapsack problem
- Quadratic knapsack problems
Cited in
(42)- Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
- Solving the 0-1 quadratic knapsack problem with a competitive quantum inspired evolutionary algorithm
- A cut-and-branch algorithm for the quadratic knapsack problem
- Dantzig-Wolfe reformulations for binary quadratic problems
- 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
- Reformulation of the quadratic multidimensional knapsack problem as copositive/completely positive programs
- Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem
- A new variable reduction technique for convex integer quadratic programs
- A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem
- A computational study on the quadratic knapsack problem with multiple constraints
- Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem
- Using modifications to Grover's search algorithm for quantum global optimization
- A lifted-space dynamic programming algorithm for the quadratic knapsack problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Exact solution methods for the \(k\)-item quadratic knapsack problem
- A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
- Inductive linearization for binary quadratic programs with linear constraints: a computational study
- Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem
- Interval uncertainty-based robust optimization for convex and non-convex quadratic programs with applications in network infrastructure planning
- Lagrangian heuristics for the quadratic knapsack problem
- Dual mean field search for large scale linear and quadratic knapsack problems
- Quadratic Combinatorial Optimization Using Separable Underestimators
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
- 0-1 quadratic knapsack problems: an exact approach based on a \(t\)-linearization
- Lagrangean methods for 0-1 quadratic problems
- Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation
- Hub-and-spoke network design and fleet deployment for string planning of liner shipping
- An iterated ``hyperplane exploration approach for the quadratic knapsack problem
- On reduction of duality gap in quadratic knapsack problems
- Simple solution methods for separable mixed linear and quadratic knapsack problem
- Solution of large quadratic knapsack problems through aggressive reduction
- Theoretical and computational study of several linearisation techniques for binary quadratic problems
- On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
- Asymptotic behavior of the quadratic knapsack problem
- Global optimality conditions and optimization methods for quadratic knapsack problems
- Combining Constraint Propagation and Discrete Ellipsoid-Based Search to Solve the Exact Quadratic Knapsack Problem
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Generalized quadratic multiple knapsack problem and two solution approaches
- Iterated responsive threshold search for the quadratic multiple knapsack problem
This page was built for publication: An exact method based on Lagrangian decomposition 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 Q703909)
