Anstreicher K.M.

K.M. Anstreicher

Information about the author K.M. Anstreicher will soon be added to the site.
Found 4 papers in total
Recent advances in the solution of quadratic assignment problems
Recent advances in the solution of quadratic assignment problems
2003
The quadratic assignment problem (QAP) is notoriously difficult for exact solution...
On Vaidya's volumetric cutting plane method for convex programming
On Vaidya's volumetric cutting plane method for convex programming
1997
We describe a simplified and strengthened version of Vaidya's volumetric cutting plane...
A new bound for the quadratic assignment problem based on convex quadratic programming
A new bound for the quadratic assignment problem based on convex quadratic programming
2001
We describe a new convex quadratic programming bound for the quadratic assignment...
Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems
Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems
1999
We consider a new nonlinear relaxation for the Constrained Maximum-Entropy Sampling...
Papers per page: