Approximation and complexity in numerical optimization. Continuous and discrete problems. Conference, Univ. of Florida, Orlando, FL, USA, February 28 - March 2, 1999

zbMath0949.00027MaRDI QIDQ1582793

No author found.

Publication date: 16 October 2000

Published in: Nonconvex Optimization and Its Applications (Search for Journal in Brave)

zbMATH Keywords

Conference; Proceedings; Orlando, FL (USA); Numerical optimization

Mathematics Subject Classification ID

00B25: Proceedings of conferences of miscellaneous specific interest

65-06: Proceedings, conferences, collections, etc. pertaining to numerical analysis

90-06: Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming

Related Items

A Complexity Analysis of Local Search Algorithms in Global Optimization, Book review of: B. Goldengorin et al., Cell formation in industrial engineering. Theory, algorithms and experiments, Approximation algorithms for multiple terminal, Hamiltonian path problems, Complexity of necessary efficiency in interval linear programming and multiobjective linear programming, Approximation algorithm for a class of global optimization problems