Exact and Heuristic Methods in Combinatorial Optimization

More about the book

In recent decades, advancements in algorithms, hardware, and software have created an ideal environment for developing methods to solve complex optimization problems. This monograph presents state-of-the-art methodologies for addressing combinatorial optimization challenges, illustrated through two well-known problems. The second edition expands on the first by introducing the ‘maximum diversity problem’ (MDP) alongside the previously included ‘linear ordering problem’ (LOP). It equips readers with the necessary background, elements, and strategies to approach various combinatorial optimization issues. The exact and heuristic techniques discussed can be applied across a wide range of problems. While the authors use LOP and MDP to showcase advanced optimization technologies, the text also serves as a tutorial for designing effective implementations of both exact and heuristic procedures. It outlines fundamental principles that empower students and practitioners to develop valuable applications based on these technologies. Targeted at engineers, scientists, operations researchers, and application specialists, the book offers a comprehensive overview of recent optimization tools and advances in search strategies, emphasizing their algorithmic and computational aspects.