Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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.

Combinatorial optimization. --- Lagrangian functions.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Combinatorial optimization. --- Assembly-line methods.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

A First Course in Combinatorial Optimization is a 2004 text for a one-semester introductory graduate-level course for students of operations research, mathematics, and computer science. It is a self-contained treatment of the subject, requiring only some mathematical maturity. Topics include: linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Central to the exposition is the polyhedral viewpoint, which is the key principle underlying the successful integer-programming approach to combinatorial-optimization problems. Another key unifying topic is matroids. The author does not dwell on data structures and implementation details, preferring to focus on the key mathematical ideas that lead to useful models and algorithms. Problems and exercises are included throughout as well as references for further study.

Combinatorial optimization --- Combinatorial optimization. --- Combinatorial analysis. --- Combinatorics --- Algebra --- Mathematical analysis --- Optimization, Combinatorial --- Combinatorial analysis --- Mathematical optimization

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Combinatorial optimization. --- Combinatorial optimization --- Optimization, Combinatorial --- Combinatorial analysis --- Mathematical optimization --- Programació en nombres enters --- Optimització combinatòria