Ergebnisse für: Polyhedral combinatorics
Hier findest Du Bücher, die sich mit Polyhedral combinatorics beschäftigen.
This book defines and studies a combinatorial object called the pedigree and develops the theory for optimising a linear function over the convex hull of pedigrees (the Pedigree polytope). A strongly polynomial algorithm implementing the framework given in the book for checking membership in the ped...
Optimization has long been a source of both inspiration and applications for geometers, and conversely, discrete and convex geometry have provided the foundations for many optimization techniques, leading to a rich interplay between these subjects. The purpose of the Workshop on Discrete Geometry, t...
Branch-and-bound is a well-established tool for solving binary programs. If symmetries are present, however, even instances of moderate size may be hard to solve. For this reason, several techniques to handle symmetries have been developed.
This thesis reviews existing symmetry handling techniques ...
Branch-and-bound is a well-established tool for solving binary programs. If symmetries are present, however, even instances of moderate size may be hard to solve. For this reason, several techniques to handle symmetries have been developed.
This thesis reviews existing symmetry handling techniques ...
This book examines the problem of maintenance planning and scheduling in industrial production systems. It presents two practically relevant, deterministic mathematical models: the capacitated planned maintenance problem (CPMP) and the weighted uncapacitated planned maintenance problem (WUPMP). It i...
This book examines the problem of maintenance planning and scheduling in industrial production systems. It presents two practically relevant, deterministic mathematical models: the capacitated planned maintenance problem (CPMP) and the weighted uncapacitated planned maintenance problem (WUPMP). It i...
This book constitutes the proceedings of the 8th International Conference on Mathematical Software, ICMS 2024, held in Durham, UK, during July 22–25, 2024.
The 37 full papers presented were carefully reviewed and selected from 46 submissions. The papers are organized in subject areas as foll...
This book defines and studies a combinatorial object called the pedigree and develops the theory for optimising a linear function over the convex hull of pedigrees (the Pedigree polytope). A strongly polynomial algorithm implementing the framework given in the book for checking membership in the ped...
Optimization has long been a source of both inspiration and applications for geometers, and conversely, discrete and convex geometry have provided the foundations for many optimization techniques, leading to a rich interplay between these subjects. The purpose of the Workshop on Discrete Geometry, t...
This book constitutes the
refereed proceedings of the 18th International Conference on Integer
Programming and Combinatorial Optimization, IPCO 2016, held in Liège, Belgium,
in June 2016. The 33 full papers presented were carefully reviewed and selected
from 125 submissions. The conference is a for...
This book constitutes the proceedings of the 8th International Conference on Mathematical Software, ICMS 2024, held in Durham, UK, during July 22–25, 2024.
The 37 full papers presented were carefully reviewed and selected from 46 submissions. The papers are organized in subject areas as foll...
This book constitutes the
refereed proceedings of the 18th International Conference on Integer
Programming and Combinatorial Optimization, IPCO 2016, held in Liège, Belgium,
in June 2016. The 33 full papers presented were carefully reviewed and selected
from 125 submissions. The conference is a for...
This volume constitutes the proceedings of the Fourth International Conference on Integer Programming and Combinatorial Optimization, IPCO '95, held in Copenhagen in May 1995 under the sponsorship of the Mathematical Programming Society.Integer programming and combinatorial optimization provide a fr...
This volume constitutes the proceedings of the Fourth International Conference on Integer Programming and Combinatorial Optimization, IPCO '95, held in Copenhagen in May 1995 under the sponsorship of the Mathematical Programming Society.Integer programming and combinatorial optimization provide a fr...
This book offers an in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization.These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science. In eigh...
This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation a...
The problem of designing a cost-efficient network that
survives the failure of one or more nodes or edges of the
network is critical to modern telecommunications
engineering. The method developed in this book is designed
to solve such problems to optimality. In particular, a
cutting ...
Unravel the mysteries of complex shapes called algebraic varieties! Computational algebraic geometry embarks on a journey with two powerful tools: toric and tropical varieties.
Imagine a hidden world built from equations. Toric geometry acts as a translator, converting these equations into a structu...