Roland Grappe
YOU?
Author Swipe
View article: A weak box-perfect graph theorem
A weak box-perfect graph theorem Open
View article: Hard Problems In Box-Totally Dual Integral Polyhedra
Hard Problems In Box-Totally Dual Integral Polyhedra Open
In this paper, we study the complexity of some fundamental questions regarding box-totally dual integral (box-TDI) polyhedra. First, although box-TDI polyhedra have strong integrality properties, we prove that Integer Programming over box-…
View article: Hard Problems on Box-Totally Dual Integral Polyhedra
Hard Problems on Box-Totally Dual Integral Polyhedra Open
View article: Cut and Price pour le problème de coloration
Cut and Price pour le problème de coloration Open
International audience
View article: Box-total dual integrality, box-integrality, and equimodular matrices
Box-total dual integrality, box-integrality, and equimodular matrices Open
View article: The Schrijver system of the flow cone in series–parallel graphs
The Schrijver system of the flow cone in series–parallel graphs Open
View article: Trader multiflow and box-TDI systems in series–parallel graphs
Trader multiflow and box-TDI systems in series–parallel graphs Open
View article: The <i>st</i>-bond polytope on series-parallel graphs
The <i>st</i>-bond polytope on series-parallel graphs Open
The st -bond polytope of a graph is the convex hull of the incidence vectors of its st -bonds, where an st -bond is a minimal st -cut. In this paper, we provide a linear description of the st -bond polytope on series-parallel graphs. We al…
View article: Principally Box-integer Polyhedra and Equimodular Matrices
Principally Box-integer Polyhedra and Equimodular Matrices Open
A polyhedron is box-integer if its intersection with any integer box $\{\ell\leq x \leq u\}$ is integer. We define principally box-integer polyhedra to be the polyhedra $P$ such that $kP$ is box-integer whenever $kP$ is integer. We charact…
View article: Lexicographical polytopes
Lexicographical polytopes Open
View article: Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks
Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks Open
View article: Circuit and bond polytopes on series–parallel graphs
Circuit and bond polytopes on series–parallel graphs Open