Pages that link to "Item:Q4575702"
From MaRDI portal
The following pages link to An FPTAS for Minimizing Indefinite Quadratic Forms over Integers in Polyhedra (Q4575702):
Displayed 8 items.
- On approximation algorithms for concave mixed-integer quadratic programming (Q1800986) (← links)
- Electrical flows over spanning trees (Q2097649) (← links)
- Provable randomized rounding for minimum-similarity diversification (Q2134050) (← links)
- Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
- Short Presburger Arithmetic Is Hard (Q5073520) (← links)
- Subdeterminants and Concave Integer Quadratic Programming (Q5206942) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)
- An approximation algorithm for indefinite mixed integer quadratic programming (Q6165586) (← links)