Jean François Maurras

According to our database, Jean François Maurras authored at least 23 papers between 1972 and 2014.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2014

On cardinality constrained polymatroids.

Jean François Maurras, Ingo Spiegelberg, Rüdiger Stephan

Discret. Appl. Math., 2014

On the linear description of the Huffman trees polytope.

Jean François Maurras, Thanh Hai Nguyen, Viet Hung Nguyen

Discret. Appl. Math., 2014

2011

On the cardinality constrained matroid polytope.

Jean François Maurras, Rüdiger Stephan

Networks, 2011

2010

Note on separation from membership, and folklore.

Jean François Maurras

Math. Program., 2010

On the Convex Hull of Huffman Trees.

Jean François Maurras, Thanh Hai Nguyen, Viet Hung Nguyen

Electron. Notes Discret. Math., 2010

2009

A family of easy polyhedra.

Jean François Maurras

4OR, 2009

2008

On the convex hull of projective planes.

Jean François Maurras, Roumen Nedev

RAIRO Oper. Res., 2008

2007

Editorial.

Jean François Maurras, Ali Ridha Mahjoub

RAIRO Oper. Res., 2007

2004

Network synthesis under survivability constraints.

Jean François Maurras, Sonia Vanier

4OR, 2004

2003

Enveloppe convexe des hyperplans d'un espace affine fini.

Olivier Anglada, Jean François Maurras

RAIRO Oper. Res., 2003

2002

On the linear description of the 3-cycle polytope.

Viet Hung Nguyen, Jean François Maurras

Eur. J. Oper. Res., 2002

Graphs and Scheduling (ECCO XII).

Silvano Martello, Jean François Maurras

Eur. J. Oper. Res., 2002

From Membership to Separation, a Simple Construction.

Jean François Maurras

Comb., 2002

2001

A Procedure of Facet Composition for the Symmetric Traveling Salesman Polytope.

Jean François Maurras, Viet Hung Nguyen

Proceedings of the Combinatorial Optimization, 2001

2000

A primal partitioning approach for single and non-simultaneous multicommodity flow problems.

Malika Hadjiat, Jean François Maurras, Yann Vaxès

Eur. J. Oper. Res., 2000

1997

Multicommodity network flow with jump constraints.

Jean François Maurras, Yann Vaxès

Discret. Math., 1997

A strongly polynomial algorithm for the minimum cost tension problem.

Malika Hadjiat, Jean François Maurras

Discret. Math., 1997

1993

The line-polytope of a finite affine plane.

Jean François Maurras

Discret. Math., 1993

Hypergraphes de Petersen! Hypergraphes de Moore?

Jean François Maurras

Discret. Math., 1993

1988

More on the plane of order 10.

Jean François Maurras

Proceedings of the Coding Theory and Applications, 1988

1983

Convex hull of the edges of a graph and near bipartite graphs.

Jean François Maurras

Discret. Math., 1983

1981

Polynomial algorithms for a class of linear programs.

Jean François Maurras, Klaus Truemper, M. Akgül

Math. Program., 1981

1972

Optimization of the flow through networks with gains.

Jean François Maurras

Math. Program., 1972