Jean François Maurras - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 24 from 24

2014

On cardinality constrained polymatroidsJean François Maurras, Ingo Spiegelberg, Rüdiger Stephan. DAM, 164:237-245, 2014. [doi]

On the linear description of the Huffman trees polytopeJean François Maurras, Thanh Hai Nguyen, Viet Hung Nguyen. DAM, 164:225-236, 2014. [doi]

2011

On the cardinality constrained matroid polytopeJean François Maurras, Rüdiger Stephan. networks, 57(3):240-246, 2011. [doi]

2010

Note on separation from membership, and folkloreJean François Maurras. mp, 124(1-2):7-11, 2010. [doi]

On the Convex Hull of Huffman TreesJean François Maurras, Thanh Hai Nguyen, Viet Hung Nguyen. endm, 36:1009-1016, 2010. [doi]

2009

A family of easy polyhedraJean François Maurras. 4or, 7(2):139-144, 2009. [doi]

2008

On the convex hull of projective planesJean François Maurras, Roumen Nedev. rairo, 42(3):285-289, 2008. [doi]

2007

EditorialJean François Maurras, Ali Ridha Mahjoub. rairo, 41(3):231-233, 2007. [doi]

2004

Network synthesis under survivability constraintsJean François Maurras, Sonia Vanier. 4or, 2(1):53-67, 2004. [doi]

2003

Enveloppe convexe des hyperplans d'un espace affine finiOlivier Anglada, Jean François Maurras. rairo, 37(4):213-219, 2003. [doi]

2002

Graphs and Scheduling (ECCO XII)Silvano Martello, Jean François Maurras. eor, 137(2):231-232, 2002. [doi]

From Membership to Separation, a Simple ConstructionJean François Maurras. combinatorica, 22(4):531-536, 2002. [doi]

On the linear description of the 3-cycle polytopeViet Hung Nguyen, Jean François Maurras. eor, 137(2):310-325, 2002. [doi]

2001

A Procedure of Facet Composition for the Symmetric Traveling Salesman PolytopeJean François Maurras, Viet Hung Nguyen. aussois 2003: 134-146 [doi]

2000

A primal partitioning approach for single and non-simultaneous multicommodity flow problemsMalika Hadjiat, Jean François Maurras, Yann Vaxès. eor, 123(2):382-393, 2000. [doi]

A procedure of facet composition for the symmetric Traveling Salesman PolytopeViet Hung Nguyen, Jean François Maurras. endm, 5:251-252, 2000. [doi]

1997

A strongly polynomial algorithm for the minimum cost tension problemMalika Hadjiat, Jean François Maurras. DM, 165-166:377-394, 1997. [doi]

Multicommodity network flow with jump constraintsJean François Maurras, Yann Vaxès. DM, 165-166:481-486, 1997. [doi]

1993

Hypergraphes de Petersen! Hypergraphes de Moore?Jean François Maurras. DM, 111(1-3):373-379, 1993. [doi]

The line-polytope of a finite affine planeJean François Maurras. DM, 115(1-3):283-286, 1993. [doi]

1988

More on the plane of order 10Jean François Maurras. coding 1989: 226-231

1983

Convex hull of the edges of a graph and near bipartite graphsJean François Maurras. DM, 46(3):257-265, 1983. [doi]

1981

Polynomial algorithms for a class of linear programsJean François Maurras, Klaus Truemper, M. Akgül. mp, 21(1):121-136, 1981. [doi]

1972

Optimization of the flow through networks with gainsJean François Maurras. mp, 3(1):135-144, 1972. [doi]

Sign in or sign up to see more results.

runs on WebDSL