A continuous method for computing bounds in integer quadratic optimization problems

From MaRDI portal

Publication:1200629

Jump to:navigation, search

DOI10.1007/BF00171827zbMath0762.90058OpenAlexW2010401649MaRDI QIDQ1200629

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

upper bounds Riemannian geometry differential geometry graph partitioning interior-point integer quadratic optimization

Mathematics Subject Classification ID

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

Related Items (3)

A projection technique for partitioning the nodes of a graph ⋮ Extensions on ellipsoid bounds for quadratic integer programming ⋮ Scalable Semidefinite Programming

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1200629&oldid=13260915"