Zobrazeno 1 - 10
of 74
pro vyhledávání: '"Grappe, Roland"'
In this paper, we characterize the class of {\em contraction perfect} graphs which are the graphs that remain perfect after the contraction of any edge set. We prove that a graph is contraction perfect if and only if it is perfect and the contraction
Externí odkaz:
http://arxiv.org/abs/2401.12793
Autor:
Chervet, Patrick, Grappe, Roland
Publikováno v:
In Journal of Combinatorial Theory, Series B November 2024 169:367-372
Autor:
Chervet, Patrick, Grappe, Roland, Lacroix, Mathieu, Pisanu, Francesco, Wolfler Calvo, Roberto
Publikováno v:
In Discrete Optimization November 2023 50
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 characterize them
Externí odkaz:
http://arxiv.org/abs/1804.08977
Autor:
Barbato, Michele, Grappe, Roland, Lacroix, Mathieu, Lancini, Emiliano, Wolfler Calvo, Roberto
Publikováno v:
In Discrete Applied Mathematics 15 February 2022 308:162-167
Autor:
Barbato, Michele1 (AUTHOR), Grappe, Roland2 (AUTHOR), Lacroix, Mathieu2 (AUTHOR), Lancini, Emiliano2,3 (AUTHOR) emiliano.lancini@eseo.fr
Publikováno v:
Mathematical Programming. Jan2023, Vol. 197 Issue 1, p307-336. 30p.
Autor:
Gouveia, João, Grappe, Roland, Kaibel, Volker, Pashkovich, Kanstantsin, Robinson, Richard Z., Thomas, Rekha R.
In this paper we characterize the slack matrices of cones and polytopes among all nonnegative matrices. This leads to an algorithm for deciding whether a given matrix is a slack matrix. The underlying decision problem is equivalent to the polyhedral
Externí odkaz:
http://arxiv.org/abs/1303.5670
We introduce the reverse Chv\'atal-Gomory rank r*(P) of an integral polyhedron P, defined as the supremum of the Chv\'atal-Gomory ranks of all rational polyhedra whose integer hull is P. A well-known example in dimension two shows that there exist in
Externí odkaz:
http://arxiv.org/abs/1211.0388
Publikováno v:
In Discrete Optimization February 2019 31:103-114
An extended formulation of a polyhedron $P$ is a linear description of a polyhedron $Q$ together with a linear map $\pi$ such that $\pi(Q)=P$. These objects are of fundamental importance in polyhedral combinatorics and optimization theory, and the su
Externí odkaz:
http://arxiv.org/abs/1105.4127