A unified approach to polynomially solvable cases of integer ``non-separable quadratic optimization
From MaRDI portal
Publication:1897348
DOI10.1016/0166-218X(94)00016-7zbMATH Open0839.90086MaRDI QIDQ1897348FDOQ1897348
Authors: Ross Baldick 
Publication date: 23 June 1996
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
- Convex separable optimization is not much harder than linear optimization
- Reduction of nonlinear integer separable programming problems∗
- Subdeterminants and concave integer quadratic programming
- A branch and bound algorithm for solving separable convex integer programming problems
- Separable standard quadratic optimization problems
Quadratic programming (90C20) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)
Cites Work
- Title not available (Why is that?)
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some proximity and sensitivity results in quadratic integer programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modular Constructions for Combinatorial Geometries
- Minimum cuts and related problems
- A solvable case of quadratic 0-1 programming
- Convex separable optimization is not much harder than linear optimization
- Selected Applications of Minimum Cuts in Networks
- Unimodular functions
- A polynomial algorithm for an integer quadratic non-separable transportation problem
- Degree-two Inequalities, Clique Facets, and Biperfect Graphs
- On polynomial solvability of the high multiplicity total weighted tardiness problem
- A Graph-Theoretic Equivalence for Integer Programs
- 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
- Title not available (Why is that?)
Cited In (7)
- Complexity and algorithms for nonlinear optimization problems
- Tensors in computations
- Convex separable optimization is not much harder than linear optimization
- Quadratic M-convex and L-convex functions
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
- Refined proximity and sensitivity results in linearly constrained convex separable integer programming
This page was built for publication: A unified approach to polynomially solvable cases of integer ``non-separable quadratic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1897348)
