Abstract is missing.
- Introduction, Overview, and NotationTeofilo F. Gonzalez. 1-24 [doi]
- Basic Methodologies and ApplicationsTeofilo F. Gonzalez. 27-41 [doi]
- Restriction MethodsTeofilo F. Gonzalez. 43-54 [doi]
- Greedy MethodsSamir Khuller, Balaji Raghavachari, Neal E. Young. 55-69 [doi]
- Recursive Greedy MethodsGuy Even. 71-84 [doi]
- Local RatioDror Rawitz. 87-111 [doi]
- LP Rounding and ExtensionsDaya Ram Gaur, Ramesh Krishnamurti. 113-123 [doi]
- Polynomial Time Approximation SchemesHadas Shachnai, Tami Tamir. 125-156 [doi]
- Rounding, Interval Partitioning and SeparationSartaj Sahni. 157-172 [doi]
- Asymptotic Polynomial Time Approximation SchemesRajeev Motwani, Liadan O'Callaghan, An Zhu. 173-187 [doi]
- Randomized Approximation TechniquesSotiris E. Nikoletseas, Paul G. Spirakis. 189-201 [doi]
- Distributed Approximation Algorithms via LP-Duality and RandomizationDevdatt P. Dubhashi, Fabrizio Grandoni 0001, Alessandro Panconesi. 203-224 [doi]
- Empirical Analysis of Randomised AlgorithmsHolger H. Hoos, Thomas Stützle. 225-242 [doi]
- Reductions That Preserve ApproximabilityGiorgio Ausiello, Vangelis Th. Paschos. 243-258 [doi]
- Differential Ratio ApproximationGiorgio Ausiello, Vangelis Th. Paschos. 259-274 [doi]
- Local SearchRoberto Solis-Oba, Nasim Samei. 277-294 [doi]
- Stochastic Local SearchHolger H. Hoos, Thomas Stützle. 297-307 [doi]
- Very Large-Scale Neighborhood Search: Theory, Algrithms, and ApplicationsRavindra K. Ahuja, Özlem Ergun, James B. Orlin, Abraham P. Punnen. 311-326 [doi]
- Reactive Search: Machine Learning for Memory-Based HeuristicsRoberto Battiti, Mauro Brunato. 327-344 [doi]
- Neural NetworksBhaskar DasGupta, Derong Liu 0001, Hava T. Siegelmann. 345-359 [doi]
- Principles and Strategies of Tabu SearchFred W. Glover, Manuel Laguna, Rafael Martí. 361-377 [doi]
- Evolutionary ComputationGuillermo Leguizamón, Christian Blum 0001, Enrique Alba. 379-394 [doi]
- An Introduction to Ant Colony OptimizationMarco Dorigo, Krzysztof Socha. 395-408 [doi]
- Stochastic Local Search Algorithms for Multiobjective Combinatorial Optimization: A ReviewLuís Paquete, Thomas Stützle. 411-425 [doi]
- Reoptimization of Hard Optimization ProblemsHans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm. 427-454 [doi]
- Sensitivity Analysis in Combinatorial OptimizationDavid Fernández-Baca, Balaji Venkatachalam. 455-472 [doi]
- Stability of ApproximationHans-Joachim Böckenhauer, Juraj Hromkovic, Sebastian Seibert. 473-487 [doi]
- Performance Guarantees for One Dimensional Bin PackingJános Csirik, György Dósa. 491-517 [doi]
- Variants of Classical One Dimensional Bin PackingJános Csirik, Csanád Imreh. 519-538 [doi]
- Variable Sized Bin Packing and Bin CoveringCsirik János. 539-552 [doi]
- Multidimensional Packing ProblemsLeah Epstein, Rob van Stee. 553-570 [doi]
- Practical Algorithms for Two-Dimensional Packing of RectanglesShinji Imahori, Mutsunori Yagiura, Hiroshi Nagamochi. 571-583 [doi]
- Practical Algorithms for Two-Dimensional Packing of General ShapesYannan Hu, Hideki Hashimoto, Shinji Imahori, Mutsunori Yagiura. 585-609 [doi]
- Prize Collecting Traveling Salesman and Related ProblemsGiorgio Ausiello, Vincenzo Bonifaci, Stefano Leonardi, Alberto Marchetti-Spaccamela. 611-628 [doi]
- A Development and Deployment Framework for Distributed Branch-and-BoundPeter R. Cappello, Christopher James Coakley. 629-640 [doi]
- Approximations for Steiner Minimum TreesDing-Zhu Du, Weili Wu. 641-655 [doi]
- Practical Approximations of Steiner Trees in Uniform Orientation MetricsAndrew B. Kahng, Ion I. Mandoiu, Alexander Zelikovsky. 657-669 [doi]
- Algorithms for Chromatic Sums, Multicoloring, and Scheduling Dependent JobsMagnús M. Halldórsson, Guy Kortsarz. 671-684 [doi]
- Approximation Algorithms and Heuristics for Classical PlanningJeremy Frank, Minh Do, J. Benton. 685-711 [doi]
- Generalized Assignment ProblemWei Wu 0017, Mutsunori Yagiura, Toshihide Ibaraki. 713-736 [doi]
- Linear Ordering ProblemCelso S. Sakuraba, Mutsunori Yagiura. 737-751 [doi]
- Submodular Functions Maximization ProblemsNiv Buchbinder, Moran Feldman. 753-788 [doi]