Packing under convex quadratic constraints
From MaRDI portal
Publication:2118134
DOI10.1007/s10107-021-01675-6zbMath1489.90157OpenAlexW4206564869MaRDI QIDQ2118134
Marc E. Pfetsch, Max Klimm, Rico Raber, Martin Skutella
Publication date: 22 March 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-021-01675-6
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Cotenancy and competition in an experimental auction market for natural gas pipeline networks
- A note on maximizing a submodular set function subject to a knapsack constraint
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- The quadratic 0-1 knapsack problem with series-parallel support
- Pipage rounding: a new method of constructing algorithms with proven performance guarantee
- Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions
- Truthful approximation mechanisms for restricted combinatorial auctions
- Approximation of the Quadratic Knapsack Problem
- Approximation Techniques for Utilitarian Mechanism Design
- Speed scaling to manage energy and temperature
- Knapsack auctions
- Quadratic knapsack problems
- The polynomial solvability of convex quadratic programming
- Optimal Auction Design
- Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
- Manipulation of Voting Schemes: A General Result
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Approximate Algorithms for the 0/1 Knapsack Problem
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
- Reducibility among Combinatorial Problems
- Packing Under Convex Quadratic Constraints
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
