default search action
Jean François Maurras
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [j22]Jean François Maurras, Thanh Hai Nguyen, Viet Hung Nguyen:
On the linear description of the Huffman trees polytope. Discret. Appl. Math. 164: 225-236 (2014) - [j21]Jean François Maurras, Ingo Spiegelberg, Rüdiger Stephan:
On cardinality constrained polymatroids. Discret. Appl. Math. 164: 237-245 (2014) - 2011
- [j20]Jean François Maurras, Rüdiger Stephan:
On the cardinality constrained matroid polytope. Networks 57(3): 240-246 (2011) - 2010
- [j19]Jean François Maurras, Thanh Hai Nguyen, Viet Hung Nguyen:
On the Convex Hull of Huffman Trees. Electron. Notes Discret. Math. 36: 1009-1016 (2010) - [j18]Jean François Maurras:
Note on separation from membership, and folklore. Math. Program. 124(1-2): 7-11 (2010)
2000 – 2009
- 2009
- [j17]Jean François Maurras:
A family of easy polyhedra. 4OR 7(2): 139-144 (2009) - 2008
- [j16]Jean François Maurras, Roumen Nedev
:
On the convex hull of projective planes. RAIRO Oper. Res. 42(3): 285-289 (2008) - 2007
- [j15]Jean François Maurras, Ali Ridha Mahjoub:
Editorial. RAIRO Oper. Res. 41(3): 231-233 (2007) - 2004
- [j14]Jean François Maurras, Sonia Vanier
Network synthesis under survivability constraints. 4OR 2(1): 53-67 (2004) - 2003
- [j13]Olivier Anglada, Jean François Maurras:
Enveloppe convexe des hyperplans d'un espace affine fini. RAIRO Oper. Res. 37(4): 213-219 (2003) - 2002
- [j12]Jean François Maurras:
From Membership to Separation, a Simple Construction. Comb. 22(4): 531-536 (2002) - [j11]Silvano Martello, Jean François Maurras:
Graphs and Scheduling (ECCO XII). Eur. J. Oper. Res. 137(2): 231-232 (2002) - [j10]Viet Hung Nguyen, Jean François Maurras:
On the linear description of the 3-cycle polytope. Eur. J. Oper. Res. 137(2): 310-325 (2002) - 2001
- [c2]Jean François Maurras, Viet Hung Nguyen:
A Procedure of Facet Composition for the Symmetric Traveling Salesman Polytope. Combinatorial Optimization 2001: 134-146 - 2000
- [j9]Viet Hung Nguyen, Jean François Maurras:
A procedure of facet composition for the symmetric Traveling Salesman Polytope. Electron. Notes Discret. Math. 5: 251-252 (2000) - [j8]Malika Hadjiat, Jean François Maurras, Yann Vaxès:
A primal partitioning approach for single and non-simultaneous multicommodity flow problems. Eur. J. Oper. Res. 123(2): 382-393 (2000)
1990 – 1999
- 1997
- [j7]Malika Hadjiat, Jean François Maurras:
A strongly polynomial algorithm for the minimum cost tension problem. Discret. Math. 165-166: 377-394 (1997) - [j6]Jean François Maurras, Yann Vaxès:
Multicommodity network flow with jump constraints. Discret. Math. 165-166: 481-486 (1997) - 1993
- [j5]Jean François Maurras:
Hypergraphes de Petersen! Hypergraphes de Moore? Discret. Math. 111(1-3): 373-379 (1993) - [j4]Jean François Maurras:
The line-polytope of a finite affine plane. Discret. Math. 115(1-3): 283-286 (1993)
1980 – 1989
- 1988
- [c1]Jean François Maurras:
More on the plane of order 10. Coding Theory and Applications 1988: 226-231 - 1983
- [j3]Jean François Maurras:
Convex hull of the edges of a graph and near bipartite graphs. Discret. Math. 46(3): 257-265 (1983) - 1981
- [j2]Jean François Maurras, Klaus Truemper, M. Akgül:
Polynomial algorithms for a class of linear programs. Math. Program. 21(1): 121-136 (1981)
1970 – 1979
- 1972
- [j1]Jean François Maurras:
Optimization of the flow through networks with gains. Math. Program. 3(1): 135-144 (1972)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: