Mourad Baïou

According to our database1, Mourad Baïou authored at least 41 papers between 1997 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Lagrangian bounds for large-scale multicommodity network design: a comparison between Volume and Bundle methods.
Int. Trans. Oper. Res., 2021

2020
Network strength games: the core and the nucleolus.
Math. Program., 2020

On the p-Median Polytope and the Directed Odd Cycle Inequalities.
Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

2019
On the star forest polytope for trees and cycles.
RAIRO Oper. Res., 2019

MIND: An approach to optimize communication time via middleware tuning.
Inf. Syst., 2019

An Algorithm to Compute the Nucleolus of Shortest Path Games.
Algorithmica, 2019

Faster Algorithms for Security Games on Matroids.
Algorithmica, 2019

2018
On the p-median polytope and the odd directed cycle inequalities: Oriented graphs.
Networks, 2018

Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem.
Math. Program., 2018

The Stop Number Minimization Problem: Complexity and Polyhedral Analysis.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2017
Bounds on Directed star arboricity in some digraph classes.
Electron. Notes Discret. Math., 2017

On the Nucleolus of Shortest Path Games.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

2016
Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs.
SIAM J. Discret. Math., 2016

Preface.
RAIRO Oper. Res., 2016

On the p-median polytope and the directed odd cycle inequalities: Triangle-free oriented graphs.
Discret. Optim., 2016

A note on many-to-many matchings and stable allocations.
Discret. Appl. Math., 2016

Stackelberg Bipartite Vertex Cover and the Preflow Algorithm.
Algorithmica, 2016

2014
A polyhedral study of a two level facility location model.
RAIRO Oper. Res., 2014

On a connection between facility location and perfect graphs.
Oper. Res. Lett., 2014

The Dominating Set Polytope via Facility Location.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013
On a class of intersection graphs.
CoRR, 2013

Hardness and Algorithms for Variants of Line Graphs of Directed Graphs.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2011
On the p-Median Polytope and the Intersection Property: Polyhedra and Algorithms.
SIAM J. Discret. Math., 2011

On the linear relaxation of the p-median problem.
Discret. Optim., 2011

2010
On the p-median polytope of fork-free graphs.
Electron. Notes Discret. Math., 2010

2009
On the Integrality of Some Facility Location Polytopes.
SIAM J. Discret. Math., 2009

2008
A linear programming approach to increasing the weight of all minimum spanning trees.
Networks, 2008

On the p-median polytope of Y-free graphs.
Discret. Optim., 2008

On the Location and <i>p</i>-Median Polytopes.
Proceedings of the Research Trends in Combinatorial Optimization, 2008

2007
Characterizations of the optimal stable allocation mechanism.
Oper. Res. Lett., 2007

2005
The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation.
Electron. Notes Discret. Math., 2005

2004
Student admissions and faculty recruitment.
Theor. Comput. Sci., 2004

2003
Admissions and Recruitment.
Am. Math. Mon., 2003

2002
The Steiner Traveling Salesman Polytope and Related Polyhedra.
SIAM J. Optim., 2002

Erratum: The Stable Allocation (or Ordinal Transportation) Problem.
Math. Oper. Res., 2002

The Stable Allocation (or Ordinal Transportation) Problem.
Math. Oper. Res., 2002

2001
On the dominant of the Steiner 2-edge connected subgraph polytope.
Discret. Appl. Math., 2001

2000
The stable admissions polytope.
Math. Program., 2000

Separation of Partition Inequalities.
Math. Oper. Res., 2000

Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry).
Discret. Appl. Math., 2000

1997
Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs.
SIAM J. Discret. Math., 1997


  Loading...