Listing 1 - 10 of 115 | << page >> |
Sort by
|
Choose an application
Choose an application
Choose an application
Choose an application
This thesis by Uledi Ngulo explores decomposition methods in the field of combinatorial optimization, a branch of mathematics that deals with optimizing complex problems often found in science and technology. The work focuses on decomposing these problems into simpler subproblems to improve solution methods. Key concepts include the development of a Lagrangian principle for discrete and non-convex optimization problems, analysis of duality gaps in set covering problems, and a study of bi-objective covering problems related to real-world applications like camera surveillance systems. The research aims to enhance the understanding and application of decomposition principles in optimization tasks. It is intended for an academic audience, particularly those interested in mathematical optimization techniques.
Choose an application
Choose an application
Algorithms --- Combinatorial optimization --- Graph theory --- Mathematics
Choose an application
Describes several generic algorithmic concepts that can be used in various kinds of GA or with evolutionary optimization techniques. This title provides a better understanding of the basic workflow of GAs and GP, encouraging readers to establish new bionic, problem-independent theoretical concepts.
Algorithms. --- Combinatorial optimization. --- Programming (Mathematics) --- Evolutionary computation.
Choose an application
Combinatorial optimization --- Optimisation combinatoire --- Congresses --- Congrès --- Congresses. --- Congrès --- Combinatorial optimization - Congresses.
Choose an application
Choose an application
"Multi-Objective Combinatorial Optimization Problems and Solution Methods discusses the results of a recent multi-objective combinatorial optimization achievement that considered metaheuristic, mathematical programming, heuristic, hyper heuristic and hybrid approaches. In other words, the book presents various multi-objective combinatorial optimization issues that may benefit from different methods in theory and practice. Combinatorial optimization problems appear in a wide range of applications in operations research, engineering, biological sciences and computer science, hence many optimization approaches have been developed that link the discrete universe to the continuous universe through geometric, analytic and algebraic techniques. This book covers this important topic as computational optimization has become increasingly popular as design optimization and its applications in engineering and industry have become ever more important due to more stringent design requirements in modern engineering practice."--
Listing 1 - 10 of 115 | << page >> |
Sort by
|