Packing Under Convex Quadratic Constraints
From MaRDI portal
Publication:5041751
DOI10.1007/978-3-030-45771-6_21zbMath1503.90113arXiv1912.00468OpenAlexW3021888502MaRDI QIDQ5041751
Martin Skutella, Rico Raber, Max Klimm, Marc E. Pfetsch
Publication date: 14 October 2022
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.00468
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (2)
A PTAS for a class of binary non-linear programs with low-rank functions ⋮ Packing under convex quadratic constraints
Uses Software
Cites Work
- Unnamed Item
- 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
- Packing under convex quadratic constraints
- 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
- 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
This page was built for publication: Packing Under Convex Quadratic Constraints
