default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHandbook of Approximation Algorithms and Metaheuristics, 2018, Volume 1
- Teofilo F. Gonzalez:
Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 1: Methologies and Traditional Applications. Chapman and Hall/CRC 2018, ISBN 9781351236423 - Teofilo F. Gonzalez:
Introduction, Overview, and Notation. 1-24
Basic Methodologies
- Teofilo F. Gonzalez:
Basic Methodologies and Applications. 27-41 - Teofilo F. Gonzalez:
Restriction Methods. 43-54 - Samir Khuller, Balaji Raghavachari, Neal E. Young:
Greedy Methods. 55-69 - Guy Even:
Recursive Greedy Methods. 71-84 - Dror Rawitz:
Local Ratio. 87-111 - Daya Ram Gaur, Ramesh Krishnamurti:
LP Rounding and Extensions. 113-123 - Hadas Shachnai, Tami Tamir:
Polynomial Time Approximation Schemes. 125-156 - Sartaj Sahni:
Rounding, Interval Partitioning and Separation. 157-172 - Rajeev Motwani, Liadan O'Callaghan, An Zhu:
Asymptotic Polynomial Time Approximation Schemes. 173-187 - Sotiris E. Nikoletseas, Paul G. Spirakis:
Randomized Approximation Techniques. 189-201 - Devdatt P. Dubhashi, Fabrizio Grandoni
, Alessandro Panconesi:
Distributed Approximation Algorithms via LP-Duality and Randomization. 203-224 - Holger H. Hoos, Thomas Stützle:
Empirical Analysis of Randomised Algorithms. 225-242 - Giorgio Ausiello, Vangelis Th. Paschos:
Reductions That Preserve Approximability. 243-258 - Giorgio Ausiello, Vangelis Th. Paschos:
Differential Ratio Approximation. 259-274
Local Search, Neural Networks, and Metaheuristics
- Roberto Solis-Oba, Nasim Samei:
Local Search. 277-294 - Holger H. Hoos, Thomas Stützle:
Stochastic Local Search. 297-307 - Ravindra K. Ahuja, Özlem Ergun, James B. Orlin, Abraham P. Punnen:
Very Large-Scale Neighborhood Search: Theory, Algrithms, and Applications. 311-326 - Roberto Battiti, Mauro Brunato:
Reactive Search: Machine Learning for Memory-Based Heuristics. 327-344 - Bhaskar DasGupta, Derong Liu, Hava T. Siegelmann:
Neural Networks. 345-359 - Fred W. Glover, Manuel Laguna, Rafael Martí:
Principles and Strategies of Tabu Search. 361-377 - Guillermo Leguizamón, Christian Blum, Enrique Alba:
Evolutionary Computation. 379-394 - Marco Dorigo, Krzysztof Socha:
An Introduction to Ant Colony Optimization. 395-408
Multiobjective Optimization, Sensitivity Analysis, and Stability
- Luís Paquete, Thomas Stützle:
Stochastic Local Search Algorithms for Multiobjective Combinatorial Optimization: A Review. 411-425 - Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm:
Reoptimization of Hard Optimization Problems. 427-454 - David Fernández-Baca, Balaji Venkatachalam:
Sensitivity Analysis in Combinatorial Optimization. 455-472 - Hans-Joachim Böckenhauer, Juraj Hromkovic, Sebastian Seibert:
Stability of Approximation. 473-487
Traditional Applications
- János Csirik, György Dósa:
Performance Guarantees for One Dimensional Bin Packing. 491-517 - János Csirik, Csanád Imreh:
Variants of Classical One Dimensional Bin Packing. 519-538 - János Csirik:
Variable Sized Bin Packing and Bin Covering. 539-552 - Leah Epstein, Rob van Stee:
Multidimensional Packing Problems. 553-570 - Shinji Imahori, Mutsunori Yagiura, Hiroshi Nagamochi:
Practical Algorithms for Two-Dimensional Packing of Rectangles. 571-583 - Yannan Hu, Hideki Hashimoto, Shinji Imahori, Mutsunori Yagiura:
Practical Algorithms for Two-Dimensional Packing of General Shapes. 585-609 - Giorgio Ausiello, Vincenzo Bonifaci, Stefano Leonardi, Alberto Marchetti-Spaccamela:
Prize Collecting Traveling Salesman and Related Problems. 611-628 - Peter R. Cappello, Christopher James Coakley:
A Development and Deployment Framework for Distributed Branch-and-Bound. 629-640 - Ding-Zhu Du, Weili Wu:
Approximations for Steiner Minimum Trees. 641-655 - Andrew B. Kahng, Ion I. Mandoiu, Alexander Zelikovsky:
Practical Approximations of Steiner Trees in Uniform Orientation Metrics. 657-669 - Magnús M. Halldórsson, Guy Kortsarz:
Algorithms for Chromatic Sums, Multicoloring, and Scheduling Dependent Jobs. 671-684 - Jeremy Frank, Minh Do, J. Benton:
Approximation Algorithms and Heuristics for Classical Planning. 685-711 - Wei Wu, Mutsunori Yagiura, Toshihide Ibaraki:
Generalized Assignment Problem. 713-736 - Celso S. Sakuraba, Mutsunori Yagiura:
Linear Ordering Problem. 737-751 - Niv Buchbinder, Moran Feldman:
Submodular Functions Maximization Problems. 753-788
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-29 00:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
