Handbook of Approximation Algorithms and Metaheuristics

By Jakub Marecek. Computer/law journal, 2010

316 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/28c011bf4a371002f1857a2c083c76a450cdfaad

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Zhuwen Li
2. Qifeng Chen
3. Vladlen Koltun
4. Steven S. Skiena
5. Yiming Yang
6. Zhiqing Sun
7. Philip H. S. Torr
8. Alan L. Yuille

In Industrial and Manufacturing Engineering

1. Yiming Yang
2. Zhiqing Sun
3. Vladlen Koltun
4. Steven S. Skiena
5. Andreas Loukas
6. L. Leal-Taix'e
7. Guillem Brasó

Citations in the corpus

• DIFUSCO: Graph-based Diffusion Solvers for Combinatorial Optimization (2023, background): “Traditionally, NPC solvers rely on integer programming (IP) or hand-crafted heuristics, which demand significant expert efforts to approximate near-optimal solutions [4, 31].”
• Zero Duality Gap in Optimal Power Flow Problem (2012, unknown): “The OPF problem in this special case is also NP-hard.”
• Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search (2018, background): “In practice, NP-hard problems are often solved using heuristics that are evaluated in terms of their empirical performance on problems of various sizes and difficulty levels [15].”
• The Algorithm Design Manual (2020, background): “• Gonzalez [Gon07] – This Handbook of Approximation Algorithms and Metaheuristics contains current surveys on a variety of techniques for dealing with hard problems, both applied and theoretical.”
• Challenges and opportunities in quantum optimization (2023, unknown): “15,16).”