A polynomial case of convex integer quadratic programming problems with box integer constraints
From MaRDI portal
Publication:496616
DOI10.1007/s10898-014-0263-2zbMath1353.90090OpenAlexW2052153347MaRDI QIDQ496616
Publication date: 22 September 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-014-0263-2
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- On duality gap in binary quadratic programming
- Global optimality conditions and optimization methods for quadratic integer programming problems
- An effective branch-and-bound algorithm for convex quadratic integer programming
- New bounds on the unconstrained quadratic integer programming problem
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
- A solvable case of quadratic 0-1 programming
- A solvable class of quadratic 0-1 programming
- A polynomial algorithm for an integer quadratic non-separable transportation problem
- Ranking in quadratic integer programming problems
- Reverse search for enumeration
- A polynomial case of the cardinality-constrained quadratic optimization problem
- Lagrangian smoothing heuristics for Max-cut
- Nonlinear integer programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- An algorithm for indefinite integer quadratic programming
- An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations
- Polynomially Solvable Cases of Binary Quadratic Programs
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A Selection Problem of Shared Fixed Costs and Network Flows
- An approximate algorithm for nonlinear integer programming
- A polynomial case of unconstrained zero-one quadratic optimization
