Main

Publications

Under revision or in preparation

  1. M. Baïou, L. Beaudou, Z. Li and V. Limouzy,  "Hardness and algorithms for variants of line graphs of directed graphs," under revision in Discrete Applied Mathematics.
  2. M. Aïder, L. Aoudia, M. Baïou, A.R. Mahjoub and V.H. Nguyen, "On the star forest polytope for trees and cycles," under revision in RAIRO Operations Research.
  3. M.Baïou and F. Barahona, "Simple extended formulation for the dominating set polytope via facility location,",under revision in SIAM Journal On Discrete Mathematics.
  4. M. Baïou, F. Bendali, S. Grouche and J. Mailfert, "New Polyhedral approach for the minimum energy symmetric network connectivity problem in wireless sensor network," in preparation.
  5. M. Baïou, L. Beaudou, V. Limouzy and  H. Perret du Cray "Explicit compact formualtions for the cyles polytope and algorithms in series-parallel graphs", in preparation.
  6. M. Baïou and F. Barahona, "On the p-median polytope and the directed odd cycle inequalities: oriented graphs," submitted.

 

Journals

  1. M. Baïou and F. Barahona, "Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs",  SIAM Journal on Discrete Mathematics 30 (2016) 1290-1301.
  2. M. Baïou, "A note on many-to-many matchings and stable allocations," Discrete Applied Mathematics 202 (2016) 181-184.
  3. M. Baïou and F. Barahona, "Stackelberg Bipartite Vertex Cover and the Preflow Algorithm," Algorithmica 74 (2016) 1174-1183.
  4. M. Baïou and F. Barahona, "On the p-median polytope and the directed odd cycle inequalities: Triangle-free oriented graphs," Discrete Optimization 22 (2016) 206-224.
  5. M. Baïou and F. Barahona, "On a connection between facility location and perfect graphs", Operations Research Letters 42 (2014) 466-472.
  6. M. Baïou and F. Barahona, "A polyhedral study of a two level facility location model", RAIRO-Operations Research 48 (2014) 153-165.
  7. M. Baïou, F. Barahona, and J. Correa, "On the p-median polytope and the intersection property: polyhedra and algorithms", SIAM Journal on Discrete Mathematics 25 (2011) 1-20.
  8. M. Baïou and F. Barahona, "On the linear relaxation of the p-median problem", Discrete Optimization 8 (2011) 344-375. 13th of the top 25 hottest articles in decision sciences and discrete optimization, year  2011.
  9. M. Baïou and F. Barahona, "On the integrality of some  facility location polytopes", SIAM Journal on Discrete Mathematics 23 (2009) 665-679.
  10. M. Baïou and F. Barahona, "A linear programming approach to increasing the weight of all minimum spanning trees, Networks'' 52 (2008) 227-234.
  11. M. Baïou and F. Barahona, On the p-median polytope of Y-free graph,  Discrete Optimization 5 (2008) 205-219.
  12. M. Baïou and M. Balinski, "Characterization of the optimal stable allocation mechanism", Operations Research Letters 35 (2007) 392-402 .
  13. M. Baïou and J. R. Correa, "The node-weighted 2-edge connected subgraph problem: linear relaxation, facets and separation", Discrete Optimization 3 (2006) 123-135.
  14. M. Baïou and M. Balinski, "Student Admissions and Faculty Recruitment",  Theoretical Computer Science 322 (2004) 245-265.
  15. M. Baïou and M. Balinski, "Admissions and Recruitment", The American Mathematical Monthly 110 (2003) 386-399.
  16. M. Baïou and A. R. Mahjoub, "The Steiner traveling salesman polytope and related polyhedra", SIAM Journal on Optimization 13 (2002) 498-507.
  17. M. Baïou and M. Balinski, "The stable allocation (or ordinal transportation) problem", Mathematics of Operations Research 27 (2002) 662-680.
  18. M. Baïou, "On the dominant of Steiner 2-edge connected subgraph polytope", Discrete Applied Mathematics 112 (2001) 3-10.
  19. M. Baïou and M. Balinski,"The stable admissions polytope", Mathematical Programming 87 (2000) 427-39.
  20. M. Baïou and M. Balinski,"Many-to-many matching : Stable Polyandrous Polygamy (or Polygamous Polyandry)", Discrete Applied Mathematics 101 (2000) 1-12.
  21. M. Baïou, F. Barahona and A. R. Mahjoub,"Separation of partition inequalities", Mathematics of Operations Research 25 (2000) 243-254.
  22. M. Baïou and A. R. Mahjoub,"Steiner 2-edge connected subgraph polytopes on series-parallel graphs", SIAM Journal on Discrete Mathematics 10 (1997) 505-514.

 

Lecture Notes on Computer Science and Electronic Notes on Discrete Mathematics

 

  1. M. Baïou and F. Barahona, "Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem", accepted in IPCO 2016, to appear in LNCS.
  2. M. Baïou and F. Barahona, "Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs", IPCO 2014, Integer Programming and Combinatorial Optimization LNCS 8494 (2014) 88-101. Journal version accepted in SIAM Journal on Discrete Mathematics.
  3. M. Baïou and F. Barahona, "The dominating set polytope via facility location", ISCO 2014 Combinatorial Optimization LNCS 8596 (2014) 38-49.
  4. M. Baïou, L. Beaudou, Z. Li and V. Limouzy, Hardness and algorithms for variants of line graphs of directed graphs, ISAAC 2013, Algorithms and Computation LNCS 8283 (2013) 196-206.
  5. M. Baïou, F. Barahona and J. Correa, "On the p-median polytope for fork-free graphs," Electronic Notes on Discrete Mathematics 36 (2010) 143-149.  Long abstract in ISCO 2010.
  6. M. Baïou and J.R. Correa, "The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation", Electronic Notes in Discrete Mathematics 19 (2005) 103-106. Long abstract in GRACO 2005.

 

Book Chapters

  1. M. Baïou, F. Barahona and A.R. Mahjoub, "Partition inequalities: Separation, Extensions and Network design", in Progress in Combinatorial Optimization, edited by  A.R. Mahjoub,  ISBN: 9781848212060  (octobre 2011) 1-31.
  2. M. Baïou and  F. Barahona, "On the location and p-median polytopes", in Research Trends in Combinatorial Optimization, edited by  William Cook, László Lovász and Jens Vygen, Bonn : Verlag, ISBN-10, ISBN-13, (novembre 2008) 1-31.
  3. M. Baïou and M. Balinski,  "Flots et couplages", dans  Graphes et applications 1, sous la direction de Jean-Claude Fournier, Hermes Science, Lavoisier 2007, ISBN  978-2-7462-1656-3,  pages 183-223.

 

Scientific Popularization

  1. M. Baïou, "Allocations stables", Bulletin de la ROADEF 15 (2005) 7-10 (invited paper).
  2. M. Baïou et M. Balinski, "Découpage électoral",  Pour la science 294 (avril 2002) 60-64.
  3. M. Baïou,  M. Balinski et  G. Roqueplo,  "Charcuterie Fine",  Emission Archimède, ARTE Télévision (9 avril 2002).

 

Conferences

  1. M. Baïou, L. Beaudou, V. Limouzy and H. Perret du Cray, "Cycle de poids minimum : Polytopes et algorithmes dans les graphes series-parallèles, ROADEF 2016, Compiègne, 2016.
  2. M. Baïou and F. Barahona, "On some spanning tree games," 22nd International Symposium on Mathematical Programming ISMP 2015, Pittsburgh, USA, July 2015.
  3. M. Baïou and F. Barahona, "Simple Extended Formulation for the Dominating Set Polytope via Facility location," 22nd International Symposium on Mathematical Programming ISMP 2015, Pittsburgh, USA, July 2015.
  4. M. Baïou, F. Bendali, S. Grouche and  J. Mailfert, "Optimisation de l'énergie dans les réseaux de capteurs par contrôle de puissance,  accepted  in  ROADEF 2015'', Marseille, 2015.
  5. M. Baïou, F. Barahona and J-C. Gay, "A parallel implementation of the volume algorithm to solve the p-median problem",  IFORS 2014,  Barcelone, 2014.
  6. M. Baïou, P. Mahey and  R. Monemi, "On the polytope of the p-fixed cardinality linear ordering problem",  ROADEF 2014, Bordeaux, 2014.
  7. M. Baïou, A. Lucena,  P. Mahey and R. Monemi, "Solution methods of the p-fixed cardinality linear ordering problem", ROADEF 2014, Bordeaux, 2014.
  8. M. Baïou and  F. Barahona, "The classical Facility Location Polytope with no g-odd Y-cycle",  ISCO 2012, Second International Symposium on Combinatorial Optimization,  Athens, Greece, 2012.
  9. M. Baïou, F. Barahona and J. Correa, "Sur le polytope du p-médian et la propriété d'intersection, ROADEF 2010'', Toulouse, 2010.
  10. M. Baïou, F. Barahona and  J-C. Gay, "Restructuration de données semi-structurées : résolution par l'algorithme du volume, séquentiel et parallèe",  ROADEF2010, Toulouse, 2010.
  11. M. Baïou and F. Barahona, "The p-median polytope for restricted Y-graphs", ''FRANCORO V et ROADEF 2007", Grenoble, 2007.

 

 

 

 

edit SideBar

Blix theme adapted by David Gilbert, powered by PmWiki