About the book
Computational algorithms nowadays play a definitive role in most of the real-life applications from mobile phones to supercomputers, Internet servers, manufacturing etc. A computational algorithm is designed to optimize a certain measure for the given problem. A discrete algorithm built for an optimization problem normally deals with a large set of feasible solutions (ones that respect problem restrictions), and tries to find a feasible solution that fits better given the optimization criteria. Hence, an intelligent method for the enumeration of feasible solutions may lead to an efficient computational algorithm.
This book is intended to publish recent advances in development of efficient optimization algorithms for traditional discrete optimization and real-life optimization problems, in both single criterion and multi-criteria settings. Novel mathematical models for some real-life optimization problems and their solution methods are also welcome. Such problems may fall into either the class of the polynomially solvable problems or into the class of intractable NP-hard problems. For the first class of problems novel polynomial-time algorithms, and for the second class of problems efficient exact enumeration and approximation heuristic algorithms are welcome. Potential topics include, but are not limited to, linear and integer programming, scheduling and routing, packing and partitioning, optimization in graphs, multi-criteria optimization, time and space complexity analysis, dynamic programming.