I agree that this site is using cookies. You can find further informations here.
X
Maurras, Jean
25  results:
Search for persons X
?
1

On the linear description of the Huffman trees polytope:

Maurras, Jean-Francois ; Nguyen, Thanh Hai ; Nguyen, Viet Hung
Discrete Applied Mathematics.  164 (2014)  - p. 225-236 , 2014
Link: https://doi.org/10.1016/..
 
?
2

On cardinality constrained polymatroids:

Maurras, Jean François ; Spiegelberg, Ingo ; Stephan, Rüdiger
Discrete Applied Mathematics.  164 (2014)  - p. 237-245 , 2014
Link: https://doi.org/10.1016/..
 
?
3

On the cardinality constrained matroid polytope:

Maurras, Jean François ; Stephan, Rüdiger
Networks.  57 (2011)  3 - p. 240-246 , 2011
Link: https://doi.org/10.1002/..
 
?
4

On the connectivity of k-clique polytopes 

ZIB-Report / Konrad-Zuse-Zentrum für Informationstechnik Berlin ; 2010,29
Maurras, Jean Francois ; Nedev, Roumen ; Stephan, Rüdiger , 2010
Link: http://edok01.tib.uni-ha..
 
?
5

On the Convex Hull of Huffman Trees:

Maurras, Jean-François ; Nguyen, Thanh Hai ; Nguyen, Viet Hung
Electronic Notes in Discrete Mathematics.  36 (2010)  - p. 1009-1016 , 2010
Link: https://doi.org/10.1016/..
 
?
6

Note on separation from membership, and folklore:

Maurras, Jean François
Mathematical Programming.  124 (2010)  1-2 - p. 7-11 , 2010
Link: https://doi.org/10.1007/..
 
?
7

A family of easy polyhedra:

Maurras, Jean François
4OR.  7 (2008)  2 - p. 139-144 , 2008
Link: https://doi.org/10.1007/..
 
?
8

On the linear description of the 3-cycle polytope:

Nguyen, Viet Hung ; Maurras, Jean-François
European Journal of Operational Research.  137 (2002)  2 - p. 310-325 , 2002
Link: https://doi.org/10.1016/..
 
?
9

From Membership to Separation, a Simple Construction:

Maurras, Jean Fran�ois
Combinatorica.  22 (2002)  4 - p. 531-536 , 2002
Link: https://doi.org/10.1007/..
 
?
10

Graphs and Scheduling (ECCO XII):

Martello, Silvano ; Maurras, Jean-François
European Journal of Operational Research.  137 (2002)  2 - p. 231-232 , 2002
Link: https://doi.org/10.1016/..
 
?
11

A procedure of facet composition for the symmetric Travelin..:

Nguyen, Viet Hung ; Maurras, Jean Francois
Electronic Notes in Discrete Mathematics.  5 (2000)  - p. 251-252 , 2000
Link: https://doi.org/10.1016/..
 
?
12

A primal partitioning approach for single and non-simultane..:

Hadjiat, Malika ; Maurras, Jean-François ; Vaxes, Yann
European Journal of Operational Research.  123 (2000)  2 - p. 382-393 , 2000
Link: https://doi.org/10.1016/..
 
?
13

A strongly polynomial algorithm for the minimum cost tensio..:

Hadjiat, Malika ; Maurras, Jean François
Discrete Mathematics.  165-166 (1997)  - p. 377-394 , 1997
Link: https://doi.org/10.1016/..
 
?
14

Multicommodity network flow with jump constraints:

Maurras, Jean-François ; Vaxès, Yann
Discrete Mathematics.  165-166 (1997)  - p. 481-486 , 1997
Link: https://doi.org/10.1016/..
 
?
15

Hypergraphes de Petersen! Hypergraphes de Moore?:

Maurras, Jean FranÇois
Discrete Mathematics.  111 (1993)  1-3 - p. 373-379 , 1993
Link: https://doi.org/10.1016/..
 
1-15