Add to ORKGCe 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é.In 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é
Nous introduisons d'abord la classe des graphes k-dégénérés qui est souvent utilisée pour modéliser ...
Many IT applications require to solve decision problems which are hard from a mathematical point of ...
In this paper, we present a new set of constraints for modeling linear ordering problems on graphs u...
In this document are given Linear Program formulations of several graph problems related to the acyc...
De nombreuses applications informatiques nécessitent de résoudre des problèmes de décision qui sont ...
International audienceUne décomposition linéaire (path-decomposition) d'un graphe G = (V, E) est une...
Dans cette habilitation à diriger des recherches, nous présentons nos contributions aux formulations...
Constrained graph problems are about finding graphs respecting a given set of constraints. These pro...
This thesis expands on the notion of linear complexity for a graph as defined by Michael Orrison and...
AbstractThis paper considers polytopes of circulations (flows) on a graph which satisfy given linear...
AbstractMany combinatorial optimization problems call for the optimization of a linear function over...
The paper aims at finding acyclic graphs under a given set of constraints. More specifically, given...
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 audienceWe show that the linear or quadratic 0/1 program\[P:\quad\min\{ c^Tx+x^TFx : \...
Nous introduisons d'abord la classe des graphes k-dégénérés qui est souvent utilisée pour modéliser ...
Many IT applications require to solve decision problems which are hard from a mathematical point of ...
In this paper, we present a new set of constraints for modeling linear ordering problems on graphs u...
In this document are given Linear Program formulations of several graph problems related to the acyc...
De nombreuses applications informatiques nécessitent de résoudre des problèmes de décision qui sont ...
International audienceUne décomposition linéaire (path-decomposition) d'un graphe G = (V, E) est une...
Dans cette habilitation à diriger des recherches, nous présentons nos contributions aux formulations...
Constrained graph problems are about finding graphs respecting a given set of constraints. These pro...
This thesis expands on the notion of linear complexity for a graph as defined by Michael Orrison and...
AbstractThis paper considers polytopes of circulations (flows) on a graph which satisfy given linear...
AbstractMany combinatorial optimization problems call for the optimization of a linear function over...
The paper aims at finding acyclic graphs under a given set of constraints. More specifically, given...
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 audienceWe show that the linear or quadratic 0/1 program\[P:\quad\min\{ c^Tx+x^TFx : \...
Nous introduisons d'abord la classe des graphes k-dégénérés qui est souvent utilisée pour modéliser ...
Many IT applications require to solve decision problems which are hard from a mathematical point of ...
In this paper, we present a new set of constraints for modeling linear ordering problems on graphs u...