The quadratic knapsack problem with setup
From MaRDI portal
Cites work
- A cut-and-branch algorithm for the quadratic knapsack problem
- A dynamic programming algorithm for the knapsack problem with setup
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A Selection Problem of Shared Fixed Costs and Network Flows
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- An effective GRASP and tabu search for the 0-1 quadratic knapsack problem
- An exact approach for the 0-1 knapsack problem with setups
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- An iterated ``hyperplane exploration approach for the quadratic knapsack problem
- Constrained 0-1 quadratic programming: basic approaches and extensions
- Exact Algorithms For The Setup Knapsack Problem
- Exact approaches for the knapsack problem with setups
- Exact Solution of the Quadratic Knapsack Problem
- scientific article; zbMATH DE number 1795719 (Why is no real title available?)
- Quadratic knapsack problems
- Solution of large quadratic knapsack problems through aggressive reduction
- Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0-1 optimization problems with linear constraints
- The model thinker. What you need to know to make data work for you
- Upper and lower bounding procedures for the multiple knapsack assignment problem
- Using a mixed integer programming tool for solving the 0-1 quadratic knapsack problem
This page was built for publication: The quadratic knapsack problem with setup
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979007)
