Novel approaches to hard discrete optimization
From MaRDI portal
Publication:1812247
zbMath1013.00014MaRDI QIDQ1812247
No author found.
Publication date: 22 June 2003
Published in: Fields Institute Communications (Search for Journal in Brave)
Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Related Items (7)
Linear Programming Relaxations of Quadratically Constrained Quadratic Programs ⋮ On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming ⋮ Mixed-integer second-order cone programming for lower hedging of American contingent claims in incomplete markets ⋮ On duality gap in binary quadratic programming ⋮ Improved smoothing Newton methods for symmetric cone complementarity problems ⋮ Inexact non-interior continuation method for monotone semidefinite complementarity problems ⋮ Projection onto a Polyhedron that Exploits Sparsity
This page was built for publication: Novel approaches to hard discrete optimization
