Quadratic bottleneck knapsack problems

DOI10.1007/S10732-011-9175-1MaRDI QIDQ2359152zbMATH OpenOpenAlexFDO

Authors Ruonan Zhang, Abraham P. Punnen

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

zbMATH Keywords

bottleneckknapsack problemquadraticquadratic thresholdsemi-greedy

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Integer quadratic knapsack problems
• Approximation of the quadratic knapsack problem
• Approximation of the quadratic knapsack problem
• The quadratic knapsack problem -- a survey
• Algorithms for the solution of quadratic knapsack problems
• Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
• A note on optimal solutions to quadratic knapsack problems
• On the continuous quadratic knapsack problem
• An O(n) algorithm for quadratic knapsack problems
• A Closed-Form Solution To A Class Of Quadratic Knapsack Problems

Cites work

• A note on optimal solutions to quadratic knapsack problems
• A semidefinite programming approach to the quadratic knapsack problem
• An extended formulation approach to the edge-weighted maximal clique problem
• Diversification-driven tabu search for unconstrained binary quadratic problems
• Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
• Geometric algorithms and combinatorial optimization
• GRASP: An annoted bibliography
• scientific article; zbMATH DE number 3882470 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2050708 (Why is no real title available?)
• Linear programming for the \(0-1\) quadratic knapsack problem
• Linear time solvable optimization problems on graphs of bounded clique-width
• Linear-time computability of combinatorial problems on series-parallel graphs
• Minimum deviation and balanced optimization: A unified approach
• On a class of quadratic programs
• On combined minmax-minsum optimization
• Quadratic bottleneck problems
• Quadratic knapsack problems
• Semi-greedy heuristics: An empirical study
• The Knapsack Problem with Conflict Graphs
• The quadratic 0-1 knapsack problem with series-parallel support

Cited in

(17)

• The quadratic minimum spanning tree problem and its variations
• The quadratic 0-1 knapsack problem with series-parallel support
• The binary knapsack problem with qualitative levels
• On the rectangular knapsack problem
• On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
• The quadratic balanced optimization problem
• An approximate dynamic programming approach to convex quadratic knapsack problems
• A dynamic programming heuristic for the quadratic knapsack problem
• Approximation of the quadratic knapsack problem
• Approximating the quadratic knapsack problem on special graph classes
• Asymptotic behavior of the quadratic knapsack problem
• scientific article; zbMATH DE number 4112385 (Why is no real title available?)
• A Closed-Form Solution To A Class Of Quadratic Knapsack Problems
• A strongly polynomial FPTAS for the symmetric quadratic knapsack problem
• Quadratic bottleneck problems
• Geometric Knapsack problems
• The quadratic knapsack problem -- a survey

Describes a project that uses

Uses Software

• GRASP

This page was built for publication: Quadratic bottleneck knapsack problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2359152)