Публикации

Статьи - Конференции - Книги - Представлено - HDR - Диссертации - Программы

Статьи

O. Anglada and J.F. Maurras, Enveloppe convexe des hyperplans d’un espace affine fini, RAIRO Oper. Res., 37 (2003) 213-219.

O. Anglada and J.F. Maurras, A new invariant for the triple systems of order 15, Journal of Combinatorial Designs (2004), to appear.

D. Attali, G. Sanniti di Baja, and E. Thiel. Skeleton simplification through non significant branch removal. Image Processing and Communications, 3 (1997), 63-72.

H.-J. Bandelt, V. Chepoi, 1-Hyperbolic graphs, SIAM J. Discrete Mathematics 16(2003) 323-334.

H.-J. Bandelt and V. Chepoi, Decomposition and l_1—embedding of weakly median graphs, European J. Combinatorics, 21 (2000), 701-714.

H.-J. Bandelt, V. Chepoi, Graphs with connected medians, SIAM J. Discrete Math. 15 (2002), 268-282.

H.-J. Bandelt, V. Chepoi, A. Karzanov, A characterization of minimizable metrics in the multifacility location problem, European J. Combinatorics 21 (2000), 715-725.

H.-J. Bandelt, V. Chepoi, Embedding into the rectilinear grid, Networks 32 (1998), 127-132.

H.-J. Bandelt, V. Chepoi, M. Laurent, Embedding into rectilinear spaces, Discr. Comput. Geometry 19 (1998), 595-604.

J-M. Bienfait, P. Préa, Y. Vaxès, Sequences with Unique Sums and Differences : Solution to Problem 96-3, SIAM Review, 39(1), 1997, 138-140.

A. Brandstädt, V. Chepoi, F. Dragan, Distance approximating trees for chordal and dually chordal graphs J. Algorithms, 30 (1999) 166-184.

A. Brandstädt, V. Chepoi, F. Dragan, The algorithmic use of the hypertree structure and maximum neighbourhood orderings, Discr. Appl. Math. 83 (1998), 121-155.

A. Brandstädt, F. Dragan, V. Chepoi, V. Voloshin, Dually chordal graphs, SIAM J. Discrete Math. 11 (1998), 437-455.

A. Brandstädt, V. Chepoi, F. Dragan, Clique r-domination and clique r-packing problems on dually chordal graphs, SIAM J. Discrete Math. 10 (1997), 109—127.

V. Chepoi, Graphs of some CAT(0) complexes, Advances Appl. Math. 24 (2000), 125-179.

V. Chepoi, On distance—preserving and domination orderings, SIAM J. Discrete Math., 11 (1998), 414-436.

V. Chepoi, A note on r—dominating clique problem, Discrete Math. 183 (1998), 47-60.

V. Chepoi, A T_X approach to some results on cuts and metrics, Advances Appl. Math. 19 (1997), 453—470.

V. Chepoi, Bridged graphs are cop—win graphs: an algorithmic proof, J. Combin. Theory. ser B 69 (1997), 97-100.

V. Chepoi, Peakless functions on graphs, Discrete Appl. Math. 73 (2) (1997), 175—189.

V. Chepoi, M. Deza, V. Grishukhin, Clin d’oeil on L_1-embeddable planar graphs, Discr. Appl. Math. 80 (1997), 3-19.

V. Chepoi, F. Dragan, A note on distance approximating trees, European J. Combinatorics, 21 (2000), 761-766.

V. Chepoi, F. Dragan, Finding a central vertex in HHD-free graphs, Discrete Applied Mathematics 131 (2003), 93-111.

V. Chepoi, B. Fichet, l_infinity-Approximation via subdominants, J. Math. Psychology. 44(2000), 600-616.

V. Chepoi, B. Fichet, A note on circular decomposable metrics, Geometriae Dedicata 69 (1998), 237-240.

V. Chepoi, B. Fichet, Recognition of Robinsonian dissimilarities, J. Classification 14 (1997), 311—324.

V. Chepoi, S. Klavzar, Distances in benzenoid systems, Discrete Math. 192 (1998), 27-39.

V. Chepoi, H. Noltemeier, Y. Vaxès, Upgrading trees under diameter and budget constraints, Networks 41(2003) 24-35

V. Chepoi, A. Rollin, Interval routing in some planar networks, Theoretical Computer Science 290(2003) 1503-1540. (short version: SIROCCO 2001, 89-104).

V. Chepoi, Y. Vaxès, Augmenting trees to meet connectivity and diameter constraints, Algorithmica, 33 (2002), 243-262.

V. Chepoi, Y. Vaxès, On covering planar bridged triangulations with balls, J. Graph Theory 44(2003), 65-80.

M. Conforti, G. Cornuéjols, Graphs without Odd Holes, Parachutes or Proper Wheels: A Generalization of Meyniel Graphs and of Line Graphs of Bipartite Graphs, J. Combinatorial Theory B, 87 (2003), 300-330.

M. Conforti, G. Cornuéjols, K. Vuskovic, Square-Free Perfect Graphs, J. Combinatorial Theory B, 90 (2004) 257-307.

M. Conforti, G. Cornuéjols, K. Vuskovic, Decomposition of Odd-Hole-Free Graphs by Double Star Cutsets and 2-Joins, Special Issue: Brazilian Symposium on Graphs, Algorithms and Combinatorics, B.A. Reed, Siang W. Song and J.L. Szwarcfiter eds., Discrete Applied Mathematics, 141 (2004), 41-91.

M. Conforti, G. Cornuéjols, K. Vuskovic, Balanced Matrices, to appear in Discrete Mathematics. Special issue in honor of Claude Berge edited by A. Bondy and V. Chvatal.

M. Conforti, G. Cornuéjols, G. Zambelli, Decomposition of Berge Graphs Containing No Proper Wheel, Long Prism or their Complements, to appear in Combinatorica.

M. Conforti, G. Cornuéjols, G. Zambelli, Bicolorings and Equitable Bicolorings of Matrices, MPS/SIAM Series on Optimization, The Sharpest Cut: The Impact of Manfred Padberg and His Work, M. Grotschel ed. (2004) 33-37.

M. Conforti, G. Cornuéjols, Balanced Matrices, to appear in Handbook of Combinatorics.

G. Cornuéjols, M. Karamanov, Y. Li, Early Estimates of the Size of Branch-and-Bound Trees, to appear in INFORMS J. Computing.

G. Cornuéjols, X. Liu, A Class of Berge Perfect Graphs Containing P6, J. Combinatorial Theory B, 87 (2003), 331-347.

G. Cornuéjols, Y. Li, D. Vandenbrussche, K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau, INFORMS J. Computing, 15 (2003), 385-396.

G. Cornuéjols, Graphs and Combinatorial Optimization, Trends in Optimization, J. Lee, S. Hosten and R. Thomas eds., AMS Short Course Series (2004), to appear.

J.R. Edmonds, J.F. Maurras, A propos des Q-matrices d’Edmonds, Recherche Operationnelle, RAIRO, 31(2), 1997, 203-209.

M. Hadjiat, J-F. Maurras, A strongly polynomial algorithm for minimum cost tension problem, Discrete Mathematics, 165-166, (1997), 377-394.

M. Hadjiat, J-F. Maurras and Y. Vaxès, A primal partitioning approach for single and non-simultaneous multicommodity flow problems, European Journal Operational Research, 1(2), 2000, 382-393.

D. Fortin, R. Rudolf, Weak monge arrays in higher dimensions,Discrete Mathematics 189(1998) 105-115.

D. Fortin and I. Tsevendorj, Piecewise Convex Maximization Problems: Algorithm and Computational experiments, J. Global Optimization, 24 (2002) 61-77.

J.F. Maurras, Sous les facettes des polyèdres, Investigacion Operativa, 7 (1999) 29-68.

J.F. Maurras, From membership to separation: a simple construction, Combinatorica 22 (2002) 531-536.

J.F. Maurras, M. Kovalev, Y. Vaxès, On the convex hull of the 3-cycle of the complete graph, Pesqui. Oper., 23 (2003) 99-109.

J.F. Maurras, S. Vanier, Network Synthesis under survivability constraints, 4OR, 2(2003) 53-67.

J.F. Maurras, Y. Vaxès, Multicommodity flow with jump constraints, Discrete Mathematics, 166 (1997) 481-486.

J.F. Maurras, Nguyen V.H., On the linear description of the k-cycle polytope, International Transactions in Operational Research, Vol. 8, 6 (2001) 673-692.

V.H Nguyen, J.-F. Maurras, On the linear description of the 3-cycle polytope, European Journal of Operational Research, 137 (2002) 310-325.

P. Préa, On weak connectivity, Discrete Mathematics, 165-166 (1997) 578-586.

P. Préa, Distance sequences and percolation thresholds in Archimedean tilings, International Journal on Mathematical and Computer Modelling, 26 (1997) 317-320.

E. Remy and E. Thiel. Medial axis for chamfer distances: computing look-up tables and neighbourhoods in 2D or 3D. Pattern Recognition Letters, 23 (2002) 649-661.

E. Remy and E. Thiel. Exact Medial Axis with Euclidean Distance. Image and Vision Computing, 2004, accepted.

Труды конференций

A. Brandstädt, V. Chepoi, F. Dragan, Distance approximating trees for chordal and dually chordal graphs, ESA’97, Lecture Notes in Computer Science 1284 (1997) 78—91.

V. Chepoi, D. Cogneau, B. Fichet, Polynomial algorithms for isotonic regression problem, L_1-Statistical Procedures and Related Topics, Institute of Mathematical Statistics Lecture Notes-Monograph Series 31 (1997) 147-160.

V. Chepoi, F. F. Dragan, Chenyu Yan, Additive Spanners for k-Chordal Graphs, CIAC 2003, 96-107

V. Chepoi, F.Dragan, Y.Vaxès, Center and diameter problem in planar quadrangulations and triangulations, SODA 2002, 346-355

V. Chepoi, F. Dragan, Y. Vaxès. Addressing, distances and routing in triangular systems with applications in cellular and sensor networks. 4th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks, WMAN’04

V. Chepoi, C.Fanciullini, Y.Vaxès, Median problem in some plane triangulations and quadrangulations., Computational Geometry 27(3) 193-210 (2004), 346-355.

V. Chepoi, A. Rollin, Interval routing in some planar quadrangulations, SIROCCO 8, Proceedings in Informatics 11 (2001), 89-104.

G. Cornuéjols, X. Liu, K. Vuskovic, A Polynomial Algorithm for Recognizing Perfect Graphs, FOCS 2003, 20-27.

D.S. Dogra, D.Fortin, Simultaneous Disjoint Routing in Regular Graphs, International Conference on Graph Theory ICGT2000, Août 2000, Marseille.

M. Dror, D. Fortin, E. Naudin , C.Roucairol, Heuristics for the redistribution of a single commodity: tabu search and A* algorithm, MIC’99 Rio (Brésil).

F. Gardi. A sufficient condition for optimality in mutual exclusion scheduling for interval graphs and related classes. In: Proceedings of the 9th International Conference on Project Management and Scheduling, Nancy, France, 2004, 154-157.

F. Gardi, On the partition of an interval and circular-arc graphs into proper interval subgraphs with applications, LATIN 2004, Lecture Notes in Computer Science 2976, 129-140.

F. Gardi, An efficient algorithm for maximum disjoint matchings in a set of intervals and related problems, 2002.

F. Gardi. Planification d’horaires de travail et colorations de graphes. In: Actes des Journées Graphes, Réseaux et Modélisation (GRM 2003, Paris, France).

F. Gardi. Planification d’horaires de travail et théorie des graphes. In: Actes du 5ème Congrès de la Société Française de Recherche Opérationnelle et d’Aide à la Décision (ROADEF 2003, Avignon, France), pages 99-100.

E. Godbert, J.L. Massat, Graduating assistance to the user in a multimodal educational system, Proceedings of the 9th International Conference on Human-Computer Interaction (HCII 2001), New-Orleans, August 2001.

A. Guénoche, H. Garreta, Can we have confidence in a tree representation? Proceedings of JOBIM 2000, Lecture Notes Computer Science (2001) version française: A. Guénoche, H. Garreta, Quelle confiance accorder à une représentation arborée ?, Actes des Journées Biologie, Informatique Mathématiques, Agro-Montpellier, JOBIM’2000, 181-188.

N. Guerinik et M. Van Caneghem, Solving AirCrew Rostering Problems, Actes des Journées de l’Optimisation, JOPT’97, Montréal, Canada 1997.

N. Guerinik et M. Van Caneghem, Some Properties on the Airline Crew Rostering Problem, European Chapter on Combinatorial Optimization : ECCO X, Teneriffe 1997.

V.H.Nguyen, J.F. Maurras, A procedure of facets composition for the traveling salesman polytope, Combinatorial Optimization Workshop, Aussois, France, 2001, in the Honor of Jack Edmonds, Michael Jünger, Gerhard Reinelt and Giovanni Rinaldi (eds), Lecture Notes in Computer Science, Springer 2002.

E. Remy and E. Thiel. Computing 3D medial axis for chamfer distances. In 9th DGCI, Discrete Geometry for Computer Image, volume 1953 of Lectures Notes in Computer Science, Uppsala, Sweden, Dec 2000, 418-430.

E. Remy and E. Thiel. Optimizing 3D chamfer masks with norm constraints. In 7th IWCIA, Int. Workshop on Combinatorial Image Analysis, Caen, July 2000, 39-56.

E. Remy and E. Thiel. Structures dans les sphères de chanfrein. In 12ème RFIA, Rec. des Formes et I.A, volume 1, Paris, Fev 2000, 483-492.

E. Remy and E. Thiel. Triangulations des boules de chanfrein. In 12ème journées de l’AFIG, Reims, Nov 1999, 126-135.

E. Remy and E. Thiel. Look-Up Tables for Medial Axis on Squared Euclidean Distance Transform. In 11th DGCI, Discrete Geometry for Computer Image, volume 2886 of Lectures Notes in Computer Science, Naples, Italy, Nov 2003, 224-235.

Книги, специальные выпуски журналов

H. Garreta, Le langage et la bibliothèque C++, Ellipses, 2000.

J.F. Maurras, Programmation Linéaire, Complexité, Séparation et Optimisation, Springer Verlag, 2002.

J.F. Maurras, "European J. Operation Research", numéro spécial "European Chapter on Combinatorial Optimisation, ECCCO XII, Bendor, 1999"

G. Cornuéjols, W.R. Pulleyblank, Integer Programming, Mathematical Programming B 98 (2003), special issue in honor of Egon Balas.

Представлено к публикации:

K. Anderssen, G. Cornuéjols, Y. Li, Split Closure and Intersection Cuts, submitted to Mathematical Programming.

K. Anderssen, G. Cornuéjols, Y. Li, Improving the Performance of Mixed Integer Gomory Cuts, submitted to Management Science.

O. Anglada, J.-F. Maurras, Description partielle de l’approval voting polytope, 2002.

H.-J. Bandelt, V. Chepoi, A. Dress, J. Koolen, Combinatorics of lopsided sets, 2000.

H.-J. Bandelt, V. Chepoi, A. Dress, J. Koolen, Geometry of lopsided sets, 2000 (en préparation).

H.-J. Bandelt, V. Chepoi, The algebra of metric betweenness: subdirect representation, retractions, and axiomatics of weakly median graphs, 2002.

E. Cela, D. Fortin, R. Rudolf, Optimizing the incidences between points and arcs on a circle, RR-3593, INRIA, 1998.

H.-J. Bandelt, V. Chepoi, Metric graph theory and geometry: a survey.

V. Chepoi, Basis graphs of even delta-matroids, 2000.

V. Chepoi, F. Dragan, Y.Vaxès, Distance and routing problems in plane graphs of non-positive curvature, 2003.

V. Chepoi, K. Nouioua, Y. Vaxès, A rounding algorithm for approximating minimum Manhattan networks, 2004.

V. Chepoi, Y. Vaxès, Covering plane bridged triangulations with balls, 1999.

M. Chudnovsky, G. Cornuéjols, X. Liu, Recognizing Berge Graphs, submitted to Combinatorica.

D. Fortin, I. Tsevendorj, Global Optimization and Multi Knapsack: a Percolation Algorithm, RR-3912, INRIA, 2000.

D. Fortin, I. Tsevendorj, Nonmonotone VIP: a bundle type approach, RR-4062, INRIA, 2000.

D. Fortin, I. Tsevendorj, The Maximum Clique Regularizations: from linear to conical programming, 2002.

F. Gardi, The Mutual Exclusion Scheduling Problem for Proper Interval Graphs, 2002.

F. Gardi, A note on the Roberts characterization of proper and unit interval graphs.

J.F. Maurras, A family of easy polyhedra, Soumis à 4OR, 2003.

V.H Nguyen, J.-F. Maurras, A note on circuit polytope, 1999.

K. Nouioua, Une approche primale-duale pour le problème des réseaux de Manhattan, 2004.

HDR

E. Thiel. Géométrie des distances de chanfrein, 2001.

Диссертации

Y. Colombani, Un modèle de résolution de contraintes adapté aux problèmes d’ordonnancement, 1997 Directeur: M. Van Caneghem.

C. Delpias, Sur l’enveloppe convexe des systemes CC ou des chirotopes de rang supérieur à trois, 1997 Directeur: P. Préa.

N. Guérinik, Partition d’ensemble et planification de personnel navigant, 1998 Directeur: M. Van Caneghem.

S. Haddad, Synthèse de réseaux sécurisés, 2002 Directeur: J.F. Maurras

S. N’Dong, Un système approché de résolution numérique définitions et méthodes, 1999 Directeur: M. Van Caneghem.

V.H. N’guyen, Polyédres des cycles du graphe complet, 2000 Directeur: J.F. Maurras.

Y. Vaxès, Multiflots avec (ou sans) contraintes de bonds, 1998. Directeur: J.F. Maurras.

Программы

M. Van Caneghem, Composants du logiciel CP-AIR : essentiellement concernant la génération des rotations. Ecriture d’un simplex adapté au "set-partitionning", Ecriture en Prolog II, puis en C d’un module de génération de rotation adapté à la génération de colonnes, pour la partie "crew-scheduling". Ecriture d’un module de planification utilisant un algorithme glouton et un algorithme de réparation. (le logiciel a fonctionné à la compagnie Air Littoral et est maintenant utilisé par CORSAIR et CCM).

M. Van Caneghem, Deux logiciels pour la planification de personnel, composantes du logiciel BamBoo de la Société PrologIA (ces deux logiciels sont en exploitation).

Ch. Delpias, Logiciel de détermination de facettes de chirotopes acycliques (enveloppes convexes de configurations des points).

Y. Vaxès, Bibliothèque de fonctions pour le dimensionnement des capacités de réserve d’un réseau de télécommunications, composant sécurisation du projet ALOES reroutage (France Telecom), Label Telecom Valley de la recherche 2000 numéro 2000/001 (logiciel en exploitation).

E. Thiel, Toolkit Helium, une librairie pour créer des interfaces graphiques utilisateur sur les systèmes Unix/X11 (en particulier Linux, Solaris, IRIX et MacOS X).

E. Thiel, IPS, logiciel de manipulation d’images.

E. Thiel, Npic, logiciel de manipulation d’images en dimensions 2 à 4.