Mourad Baïou

Available identifiers

zbMath Open baiou.mouradMaRDI QIDQ210495

List of research outcomes

Publication	Date of Publication	Type
A branch-and-cut algorithm for the balanced traveling salesman problem	2024-03-04	Paper
Generalized nash fairness solutions for bi‐objective minimization problems	2024-01-18	Paper
Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods	2023-11-21	Paper
Branch-and-cut for a 2-commodity flow relocation model with time constraints	2023-08-03	Paper
Nash balanced assignment problem	2023-08-03	Paper
Monitoring a Fleet of Autonomous Vehicles Through A* Like Algorithms and Reinforcement Learning	2023-08-01	Paper
Complexity, algorithmic, and computational aspects of a dial-a-ride type problem	2023-07-11	Paper
On some algorithmic aspects of hypergraphic matroids	2022-11-23	Paper
The complexity of the unit stop number problem and its implications to other related problems	2022-05-10	Paper
Network disconnection games: a game theoretic approach to checkpoint evaluation in networks	2022-01-05	Paper
On the \(p\)-median polytope and the directed odd cycle inequalities	2021-02-04	Paper
Network strength games: the core and the nucleolus	2020-02-20	Paper
On the star forest polytope for trees and cycles	2020-02-07	Paper
An algorithm to compute the nucleolus of shortest path games	2019-06-27	Paper
Faster algorithms for security games on matroids	2019-03-11	Paper
Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem	2018-10-26	Paper
On a connection between facility location and perfect graphs	2018-09-28	Paper
On the p‐median polytope and the odd directed cycle inequalities: Oriented graphs	2018-09-04	Paper
The stop number minimization problem: complexity and polyhedral analysis	2018-08-17	Paper
On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs	2018-05-24	Paper
Bounds on directed star arboricity in some digraph classes	2018-04-09	Paper
On the nucleolus of shortest path games	2018-02-13	Paper
On the Location and p-Median Polytopes	2017-04-07	Paper
Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem	2016-08-10	Paper
Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs	2016-06-23	Paper
Stackelberg bipartite vertex cover and the preflow algorithm	2016-04-06	Paper
A note on many-to-many matchings and stable allocations	2016-02-12	Paper
The Dominating Set Polytope via Facility Location	2015-10-16	Paper
Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs	2014-06-02	Paper
A polyhedral study of a two level facility location model	2014-05-26	Paper
Hardness and Algorithms for Variants of Line Graphs of Directed Graphs	2014-01-14	Paper
On a class of intersection graphs	2013-06-11	Paper
On the linear relaxation of the \(p\)-median problem	2012-06-20	Paper
On the p-median polytope of fork-free graphs	2012-05-13	Paper
https://portal.mardi4nfdi.de/entity/Q3109933	2012-01-26	Paper
On the p-Median Polytope and the Intersection Property: Polyhedra and Algorithms	2011-10-27	Paper
On the Integrality of Some Facility Location Polytopes	2010-06-01	Paper
A linear programming approach to increasing the weight of all minimum spanning trees	2008-12-17	Paper
On the \(p\)-median polytope of \(Y\)-free graphs	2008-10-29	Paper
Characterizations of the optimal stable allocation mechanism	2008-01-21	Paper
https://portal.mardi4nfdi.de/entity/Q3439669	2007-05-29	Paper
The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation	2006-10-10	Paper
The Stable Allocation (or Ordinal Transportation) Problem	2005-11-11	Paper
Erratum: The Stable Allocation (or Ordinal Transportation) Problem	2005-11-11	Paper
Student admissions and faculty recruitment	2004-11-12	Paper
The Steiner Traveling Salesman Polytope and Related Polyhedra	2003-01-05	Paper
On the dominant of the Steiner 2-edge connected subgraph polytope	2002-02-17	Paper
Separation of Partition Inequalities	2001-11-26	Paper
The stable admissions polytope	2000-11-09	Paper
Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)	2000-10-30	Paper
Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs	1998-02-09	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Mourad Baïou