Add to ORKGIn this document are given Linear Program formulations of several graph problems related to the acyclicity constraints without the use of constraint generations.Ce document contient des formulations sous forme de Programmes Linéaire de quelques problèmes de théorie des graphes liés à des contraintes d'acyclicité
We investigate the problem of computing the strength of a graph. We describe in this article the fir...
© 2005 by Chapman & Hall/CRC Press. Graph theory offers a rich source of problems and techniques f...
In this paper, we present a new set of constraints for modeling linear ordering problems on graphs u...
Ce document contient des formulations sous forme de Programmes Linéaire de quelques problèmes de thé...
De nombreuses applications informatiques nécessitent de résoudre des problèmes de décision qui sont ...
Constrained graph problems are about finding graphs respecting a given set of constraints. These pro...
Dans cette habilitation à diriger des recherches, nous présentons nos contributions aux formulations...
AbstractMany combinatorial optimization problems call for the optimization of a linear function over...
Many IT applications require to solve decision problems which are hard from a mathematical point of ...
AbstractThis paper considers polytopes of circulations (flows) on a graph which satisfy given linear...
Optimality of a linear inequality in finitely many graph invariants is defined through a geometric a...
We show that the ellipsoid method for solving linear programs can be implemented in a way that respe...
International audienceUne décomposition linéaire (path-decomposition) d'un graphe G = (V, E) est une...
This thesis expands on the notion of linear complexity for a graph as defined by Michael Orrison and...
The paper aims at finding acyclic graphs under a given set of constraints. More specifically, given...
We investigate the problem of computing the strength of a graph. We describe in this article the fir...
© 2005 by Chapman & Hall/CRC Press. Graph theory offers a rich source of problems and techniques f...
In this paper, we present a new set of constraints for modeling linear ordering problems on graphs u...
Ce document contient des formulations sous forme de Programmes Linéaire de quelques problèmes de thé...
De nombreuses applications informatiques nécessitent de résoudre des problèmes de décision qui sont ...
Constrained graph problems are about finding graphs respecting a given set of constraints. These pro...
Dans cette habilitation à diriger des recherches, nous présentons nos contributions aux formulations...
AbstractMany combinatorial optimization problems call for the optimization of a linear function over...
Many IT applications require to solve decision problems which are hard from a mathematical point of ...
AbstractThis paper considers polytopes of circulations (flows) on a graph which satisfy given linear...
Optimality of a linear inequality in finitely many graph invariants is defined through a geometric a...
We show that the ellipsoid method for solving linear programs can be implemented in a way that respe...
International audienceUne décomposition linéaire (path-decomposition) d'un graphe G = (V, E) est une...
This thesis expands on the notion of linear complexity for a graph as defined by Michael Orrison and...
The paper aims at finding acyclic graphs under a given set of constraints. More specifically, given...
We investigate the problem of computing the strength of a graph. We describe in this article the fir...
© 2005 by Chapman & Hall/CRC Press. Graph theory offers a rich source of problems and techniques f...
In this paper, we present a new set of constraints for modeling linear ordering problems on graphs u...