A continuous method for computing bounds in integer quadratic optimization problems

DOI10.1007/BF00171827MaRDI QIDQ1200629zbMATH OpenOpenAlexFDO

Authors Anil P. Kamath, Narendra K. Karmarkar

Publication date 16 January 1993

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00171827

zbMATH Keywords

graph partitioningRiemannian geometrydifferential geometryupper boundsinterior-pointinteger quadratic optimization

Mathematics Subject Classification ID

Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 970344
• scientific article; zbMATH DE number 1054751
• Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems
• Global optimization techniques for solving the general quadratic integer programming problem
• New bounds on the unconstrained quadratic integer programming problem

Cited in

(6)

• Une borne optimale pour la programmation entière quasi-convexe
• Scalable semidefinite programming
• Continuous Approaches to the Unconstrained Binary Quadratic Problems
• scientific article; zbMATH DE number 970344 (Why is no real title available?)
• Extensions on ellipsoid bounds for quadratic integer programming
• A projection technique for partitioning the nodes of a graph

This page was built for publication: A continuous method for computing bounds in integer quadratic optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1200629)