Constrained optimization is a challenging branch of operations research that aims to create a model which has a wide range of applications in the supply chain, telecommunications and medical fields. As the problem structure is split into two main components, the objective is to accomplish the feasible set framed by the system constraints. The aim of this book is expose optimization problems that can be expressed as graphs, by detailing, for each studied problem, the set of nodes and the set of edges. This graph modeling is an incentive for designing a platform that integrates all optimization components in order to output the best solution regarding the parameters' tuning. The authors propose in their analysis, for optimization problems, to provide their graphical modeling and mathematical formulation and expose some of their variants. As a solution approaches, an optimizer can be the most promising direction for limited-size instances. For large problem instances, approximate algorithms are the most appropriate way for generating high quality solutions. The authors thus propose, for each studied problem, a greedy algorithm as a problem-specific heuristic and a genetic algorithm as a metaheuristic.
1. Basic Concepts in Optimization and Graph Theory.
2. Knapsack Problems.
3. Packing Problems.
4. Assignment Problem.
5. The Resource Constrained Project Scheduling Problem.
6. Spanning Tree Problems.
7. Steiner Problems.
8. A DSS Design for Optimization Problems.
Saoussen Krichen, LARODEC Laboratory and Faculty of Law, Economics and Management, University of Jendouba, Tunisia.
Jouhaina Chaouachi, IHEC Carthage, Tunisia.
Table of Contents
PDF File 49 Kb