For the past few decades, combinatorial optimization techniques have been shown to be
powerful tools for formulating and solving optimization problems arising from practical …

Given a graph G with distinguished nodes s and t, a cost on each edge of G, and a fixed
integer L ≧ 2, the two edge-disjoint hop-constrained paths problem is to find a minimum …

We consider the “flow on paths” versions of Max Flow and Min Cut when we restrict to paths
having at most B arcs, and for versions where we allow fractional solutions or require …

The k edge-disjoint 2-hop-constrained paths problem consists in finding a minimum cost
subgraph such that between two given nodes s and t there exist at least k edge-disjoint …

In this paper we study the extreme points of the polytope P (G), the linear relaxation of the 2-
edge connected spanning subgraph polytope of a graph G. We introduce a partial ordering …

The rate at which research ideas can be prototyped is significantly increased when re-
useable software components are employed. A mission of the Computational Infrastructure …

Název práce: Toky a cesty s omezením Autor: Dušan Knop Katedra: Katedra aplikované
matematiky Vedoucí diplomové práce: Doc. Mgr. Petr Kolman, PhD, Katedra aplikované …

Cette thèse s' inscrit dans le domaine de l'optimisation combinatoire. Elle utilise l'approche
polyèdrale pour résoudre des problèmes combinatoires qui se posent dans le contexte des …