Quadratic bottleneck knapsack problems
From MaRDI portal
Publication:2359152
DOI10.1007/s10732-011-9175-1zbMath1365.90283OpenAlexW2032499563MaRDI QIDQ2359152
Abraham P. Punnen, Ruonan Zhang
Publication date: 27 June 2017
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-011-9175-1
Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Related Items (2)
The quadratic minimum spanning tree problem and its variations ⋮ The quadratic balanced optimization problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Diversification-driven tabu search for unconstrained binary quadratic problems
- A note on optimal solutions to quadratic knapsack problems
- Minimum deviation and balanced optimization: A unified approach
- On a class of quadratic programs
- Geometric algorithms and combinatorial optimization
- Linear programming for the \(0-1\) quadratic knapsack problem
- An extended formulation approach to the edge-weighted maximal clique problem
- On combined minmax-minsum optimization
- A semidefinite programming approach to the quadratic knapsack problem
- Semi-greedy heuristics: An empirical study
- The quadratic 0-1 knapsack problem with series-parallel support
- Linear time solvable optimization problems on graphs of bounded clique-width
- The Knapsack Problem with Conflict Graphs
- Quadratic knapsack problems
- Linear-time computability of combinatorial problems on series-parallel graphs
- Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
- Quadratic bottleneck problems
This page was built for publication: Quadratic bottleneck knapsack problems
