Approximation and complexity in numerical optimization. Continuous and discrete problems. Conference, Univ. of Florida, Orlando, FL, USA, February 28 - March 2, 1999
From MaRDI portal
Publication:1582793
zbMath0949.00027MaRDI QIDQ1582793
No author found.
Publication date: 16 October 2000
Published in: Nonconvex Optimization and Its Applications (Search for Journal in Brave)
Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to numerical analysis (65-06) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Related Items
A Complexity Analysis of Local Search Algorithms in Global Optimization, Approximation algorithm for a class of global optimization problems, 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
