With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual

Iterative Computer Algorithms with Applications in Engineering describes in-depth the five main iterative algorithms for solving hard combinatorial optimization

This volume can be considered as a supplementary volume to the major three-volume Handbook of Combinatorial Optimization published by Kluwer. It can also be reg

This book presents a carefully selected group of methods for unconstrained and bound constrained optimization problems and analyzes them in depth both theoretic

Faced with the challenge of solving the hard optimization problems that abound in the real world, existing methods often encounter great difficulties. Important