Ergebnisse für: Packing problems
Hier findest Du Bücher, die sich mit Packing problems beschäftigen.
This book provides a comprehensive overview of practical cutting and packing problems, presenting practical algorithms for solving these problems from the perspective of combinatorial optimization. It also discusses the geometric properties and tools for cutting and packing problems. Problems o...
Scheduling, planning and packing are ubiquitous problems that can be found in a wide range of real-world settings. These problems transpire in a large variety of forms, and have enormous socio-economic impact. For many years, significant work has been devoted to automating the processes of schedulin...
Scheduling and packing problems are two of the most important and most studied classes of problems in discrete optimization since they are both of high practical significance and of theoretical interest. In the last decades, they emerged to be the playground for many novel algorithmic ideas that yie...
Michael Holzhauser discusses generalizations of well-known network flow and packing problems by additional or modified side constraints. By exploiting the inherent connection between the two problem classes, the author investigates the complexity and approximability of several novel network flow and...
Michael Holzhauser discusses generalizations of well-known network flow and packing problems by additional or modified side constraints. By exploiting the inherent connection between the two problem classes, the author investigates the complexity and approximability of several novel network flow and...
Graph packing problem is one of the central problems in graph theory and combinatorial optimization. The famous Steiner tree packing problem in undirected graphs has become an well-established area. It is natural to extend this problem to digraphs. The corresponding problems in digraphs are called d...
Graph packing problem is one of the central problems in graph theory and combinatorial optimization. The famous Steiner tree packing problem in undirected graphs has become an well-established area. It is natural to extend this problem to digraphs. The corresponding problems in digraphs are called d...
Scheduling, planning and packing are ubiquitous problems that can be found in a wide range of real-world settings. These problems transpire in a large variety of forms, and have enormous socio-economic impact. For many years, significant work has been devoted to automating the processes of schedulin...
This book results from a long-term research effort aimed at tackling complex non-standard packing issues which arise in space engineering. The main research objective is to optimize cargo loading and arrangement, in compliance with a set of stringent rules. Complicated geometrical aspects are also t...
This book results from a long-term research effort aimed at tackling complex non-standard packing issues which arise in space engineering. The main research objective is to optimize cargo loading and arrangement, in compliance with a set of stringent rules. Complicated geometrical aspects are also t...
Primal-dual methods have a longstanding history as a tool which proves approximation guarantees for solutions to combinatorial optimization problems. In this thesis, we investigate a general class of weighted covering problems, and static and dynamic network flow problems under uncertainty. We provi...