A polynomial case of convex integer quadratic programming problems with box integer constraints
From MaRDI portal
Recommendations
- A polynomial case of the cardinality-constrained quadratic optimization problem
- A new polynomially solvable class of quadratic optimization problems with box constraints
- An effective branch-and-bound algorithm for convex quadratic integer programming
- An effective branch-and-bound algorithm for convex quadratic integer programming
- Complexity of integer quasiconvex polynomial optimization
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1302192 (Why is no real title available?)
- scientific article; zbMATH DE number 1383707 (Why is no real title available?)
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
- A Selection Problem of Shared Fixed Costs and Network Flows
- A polynomial algorithm for an integer quadratic non-separable transportation problem
- A polynomial case of the cardinality-constrained quadratic optimization problem
- A polynomial case of unconstrained zero-one quadratic optimization
- A solvable case of quadratic 0-1 programming
- A solvable class of quadratic 0-1 programming
- An algorithm for indefinite integer quadratic programming
- An approximate algorithm for nonlinear integer programming
- An effective branch-and-bound algorithm for convex quadratic integer programming
- An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Global optimality conditions and optimization methods for quadratic integer programming problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Lagrangian smoothing heuristics for Max-cut
- New bounds on the unconstrained quadratic integer programming problem
- Nonlinear integer programming
- On duality gap in binary quadratic programming
- Polynomially solvable cases of binary quadratic programs
- Ranking in quadratic integer programming problems
- Reverse search for enumeration
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
Cited in
(5)- A new variable reduction technique for convex integer quadratic programs
- scientific article; zbMATH DE number 4133835 (Why is no real title available?)
- The quadratic Graver cone, quadratic integer minimization, and extensions
- A polynomial case of the cardinality-constrained quadratic optimization problem
- A new polynomially solvable class of quadratic optimization problems with box constraints
This page was built for publication: A polynomial case of convex integer quadratic programming problems with box integer constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496616)
