A unified approach to polynomially solvable cases of integer ``non-separable quadratic optimization
From MaRDI portal
Publication:1897348
DOI10.1016/0166-218X(94)00016-7zbMath0839.90086MaRDI QIDQ1897348
Publication date: 23 June 1996
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Quadratic programming (90C20)
Related Items
Tensors in computations, Quadratic M-convex and L-convex functions, Refined proximity and sensitivity results in linearly constrained convex separable integer programming, Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach, Complexity and algorithms for nonlinear optimization problems
Cites Work
- Some proximity and sensitivity results in quadratic integer programming
- Unimodular functions
- A solvable case of quadratic 0-1 programming
- A polynomial algorithm for an integer quadratic non-separable transportation problem
- On polynomial solvability of the high multiplicity total weighted tardiness problem
- Geometric algorithms and combinatorial optimization
- Refined proximity and sensitivity results in linearly constrained convex separable integer programming
- Generalization of Barahona's algorithm for cases of integer non-linear programming with box constraints
- Degree-two Inequalities, Clique Facets, and Biperfect Graphs
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Selected Applications of Minimum Cuts in Networks
- Modular Constructions for Combinatorial Geometries
- Minimum cuts and related problems
- A Graph-Theoretic Equivalence for Integer Programs
- Convex separable optimization is not much harder than linear optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
