default search action
Mourad Baïou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j43]José Luis Figueroa González
, Mourad Baïou
A project and lift approach for a 2-commodity flow relocation model in a time expanded network. Discret. Appl. Math. 356: 350-368 (2024) - [j42]Thi Quynh Trang Vo, Mourad Baïou, Viet Hung Nguyen
A branch-and-cut algorithm for the balanced traveling salesman problem. J. Comb. Optim. 47(2): 4 (2024) - [j41]Mourad Baïou, José Correa, Rida Laraki:
Mathematical Optimization for Fair Social Decisions: A Tribute to Michel Balinski. Math. Program. 203(1): 1-7 (2024) - [j40]Minh Hieu Nguyen, Mourad Baïou, Viet Hung Nguyen, Thi Quynh Trang Vo:
Generalized nash fairness solutions for bi-objective minimization problems. Networks 83(1): 83-99 (2024) - [c20]Minh Hieu Nguyen, Mourad Baïou, Viet Hung Nguyen, Thi Quynh Trang Vo:
Proportional Fairness for Combinatorial Optimization. LATIN (2) 2024: 304-319 - 2023
- [j39]Mourad Baïou, Francisco Barahona:
On some algorithmic aspects of hypergraphic matroids. Discret. Math. 346(2): 113222 (2023) - [j38]Mourad Baïou
Complexity, algorithmic, and computational aspects of a dial-a-ride type problem. Eur. J. Oper. Res. 310(2): 552-565 (2023) - [c19]Aurélien Mombelli, Alain Quilliot, Mourad Baïou:
Multiple Heuristics with Reinforcement Learning to Solve the Safe Shortest Path Problem in a Warehouse. ICORES (Selected Papers) 2023: 3-25 - [c18]Aurélien Mombelli, Alain Quilliot, Mourad Baïou:
A Comparison of Several Speed Computation Methods for the Safe Shortest Path Problem. ICORES 2023: 15-26 - [c17]Thi Quynh Trang Vo, Mourad Baïou, Viet Hung Nguyen, Paul Weng:
Improving Subtour Elimination Constraint Generation in Branch-and-Cut Algorithms for the TSP with Machine Learning. LION 2023: 537-551 - 2022
- [j37]Mourad Baïou, Francisco Barahona:
Network disconnection games: A game theoretic approach to checkpoint evaluation in networks. Discret. Appl. Math. 308: 198-208 (2022) - [j36]Mourad Baïou, Rafael Colares
The complexity of the unit stop number problem and its implications to other related problems. Theor. Comput. Sci. 919: 36-46 (2022) - [c16]Aurélien Mombelli, Alejandro Olivas Gonzales
Safe Management of Autonomous Vehicles. CoDIT 2022: 693-698 - [c15]Aurélien Mombelli
Searching for a Safe Shortest Path in a Warehouse. ICORES 2022: 115-122 - [c14]Minh Hieu Nguyen, Viet Hung Nguyen, Thi Quynh Trang Vo, Mourad Baïou:
Nash fairness solutions for balanced TSP. INOC 2022: 1-6 - [c13]José Luis Figueroa González, Mourad Baïou, Alain Quilliot, Hélène Toussaint, Annegret Wagler:
Branch-and-Cut for a 2-Commodity Flow Relocation Model with Time Constraints. ISCO 2022: 22-34 - [c12]Minh Hieu Nguyen, Mourad Baïou, Viet Hung Nguyen:
Nash Balanced Assignment Problem. ISCO 2022: 172-186 - [c11]Mourad Baïou, Francisco Barahona:
Packing Hypertrees and the k-cut Problem in Hypergraphs. LION 2022: 521-534 - [c10]Thi Quynh Trang Vo, Mourad Baïou, Viet Hung Nguyen, Paul Weng:
A comparative study of linearization methods for Ordered Weighted Average. RNDM 2022: 1-7 - [i2]Mourad Baïou, Gianpaolo Oriolo, Gautier Stauffer:
Horizontal collaboration in forestry: game theory models and algorithms for trading demands. CoRR abs/2211.04105 (2022) - 2021
- [j35]Rui Sa Shibasaki
Lagrangian bounds for large-scale multicommodity network design: a comparison between Volume and Bundle methods. Int. Trans. Oper. Res. 28(1): 296-326 (2021) - [c9]Mourad Baïou, Alain Quilliot, Lounis Adouane, Aurélien Mombelli
Algorithms for the Safe Management of Autonomous Vehicles. FedCSIS 2021: 153-162 - 2020
- [j34]Mourad Baïou, Francisco Barahona
Network strength games: the core and the nucleolus. Math. Program. 180(1): 117-136 (2020) - [c8]Mourad Baïou, Francisco Barahona:
On the p-Median Polytope and the Directed Odd Cycle Inequalities. ISCO 2020: 15-26 - [e1]Mourad Baïou
Combinatorial Optimization - 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4-6, 2020, Revised Selected Papers. Lecture Notes in Computer Science 12176, Springer 2020, ISBN 978-3-030-53261-1 [contents]
2010 – 2019
- 2019
- [j33]Mourad Baïou, Francisco Barahona
Faster Algorithms for Security Games on Matroids. Algorithmica 81(3): 1232-1246 (2019) - [j32]Mourad Baïou, Francisco Barahona
An Algorithm to Compute the Nucleolus of Shortest Path Games. Algorithmica 81(8): 3099-3113 (2019) - [j31]Abdeslem Belghoul, Mourad Baïou, Farouk Toumani:
MIND: An approach to optimize communication time via middleware tuning. Inf. Syst. 82: 17-32 (2019) - [j30]Méziane Aïder
On the star forest polytope for trees and cycles. RAIRO Oper. Res. 53(5): 1763-1773 (2019) - 2018
- [j29]Mourad Baïou, Francisco Barahona
Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem. Math. Program. 172(1-2): 59-75 (2018) - [j28]Mourad Baïou
On the p-median polytope and the odd directed cycle inequalities: Oriented graphs. Networks 71(4): 326-345 (2018) - [c7]Mourad Baïou, Rafael Colares, Hervé Kerivin:
The Stop Number Minimization Problem: Complexity and Polyhedral Analysis. ISCO 2018: 64-76 - 2017
- [j27]Henri Perret du Cray, Mourad Baïou, Laurent Beaudou, Vincent Limouzy:
Bounds on Directed star arboricity in some digraph classes. Electron. Notes Discret. Math. 62: 267-272 (2017) - [c6]Mourad Baïou, Francisco Barahona:
On the Nucleolus of Shortest Path Games. SAGT 2017: 55-66 - 2016
- [j26]Mourad Baïou, Francisco Barahona:
Stackelberg Bipartite Vertex Cover and the Preflow Algorithm. Algorithmica 74(3): 1174-1183 (2016) - [j25]Mourad Baïou:
A note on many-to-many matchings and stable allocations. Discret. Appl. Math. 202: 181-184 (2016) - [j24]Mourad Baïou, Francisco Barahona:
On the p-median polytope and the directed odd cycle inequalities: Triangle-free oriented graphs. Discret. Optim. 22: 206-224 (2016) - [j23]Mourad Baïou, Michel Habib, Lhouari Nourine:
Preface. RAIRO Oper. Res. 50(2): 221-222 (2016) - [j22]Mourad Baïou, Francisco Barahona:
Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs. SIAM J. Discret. Math. 30(2): 1290-1301 (2016) - [c5]Mourad Baïou, Francisco Barahona:
Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem. IPCO 2016: 63-76 - 2014
- [j21]Mourad Baïou, Francisco Barahona:
On a connection between facility location and perfect graphs. Oper. Res. Lett. 42(6-7): 466-472 (2014) - [j20]Mourad Baïou, Francisco Barahona:
A polyhedral study of a two level facility location model. RAIRO Oper. Res. 48(2): 153-165 (2014) - [c4]Mourad Baïou, Francisco Barahona:
Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs. IPCO 2014: 88-101 - [c3]Mourad Baïou, Francisco Barahona:
The Dominating Set Polytope via Facility Location. ISCO 2014: 38-49 - 2013
- [c2]Mourad Baïou, Laurent Beaudou, Zhentao Li, Vincent Limouzy:
Hardness and Algorithms for Variants of Line Graphs of Directed Graphs. ISAAC 2013: 196-206 - [i1]Mourad Baïou, Laurent Beaudou, Zhentao Li, Vincent Limouzy:
On a class of intersection graphs. CoRR abs/1306.2498 (2013) - 2011
- [j19]Mourad Baïou, Francisco Barahona:
On the linear relaxation of the p-median problem. Discret. Optim. 8(2): 344-375 (2011) - [j18]Mourad Baïou, Francisco Barahona, José Correa:
On the p-Median Polytope and the Intersection Property: Polyhedra and Algorithms. SIAM J. Discret. Math. 25(1): 1-20 (2011) - 2010
- [j17]Mourad Baïou, Francisco Barahona, José Correa:
On the p-median polytope of fork-free graphs. Electron. Notes Discret. Math. 36: 143-149 (2010)
2000 – 2009
- 2009
- [j16]Mourad Baïou, Francisco Barahona:
On the Integrality of Some Facility Location Polytopes. SIAM J. Discret. Math. 23(2): 665-679 (2009) - 2008
- [j15]Mourad Baïou, Francisco Barahona:
On the p-median polytope of Y-free graphs. Discret. Optim. 5(2): 205-219 (2008) - [j14]Mourad Baïou, Francisco Barahona:
A linear programming approach to increasing the weight of all minimum spanning trees. Networks 52(4): 227-234 (2008) - [c1]Mourad Baïou, Francisco Barahona:
On the Location and p-Median Polytopes. Bonn Workshop of Combinatorial Optimization 2008: 1-31 - 2007
- [j13]Mourad Baïou, Michel Balinski:
Characterizations of the optimal stable allocation mechanism. Oper. Res. Lett. 35(3): 392-402 (2007) - 2006
- [j12]Mourad Baïou, José R. Correa:
The node-edge weighted 2-edge connected subgraph problem: Linear relaxation, facets and separation. Discret. Optim. 3(2): 123-135 (2006) - 2005
- [j11]Mourad Baïou, José R. Correa:
The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation. Electron. Notes Discret. Math. 19: 103-109 (2005) - 2004
- [j10]Mourad Baïou, Michel Balinski:
Student admissions and faculty recruitment. Theor. Comput. Sci. 322(2): 245-265 (2004) - 2003
- [j9]Mourad Baïou, Michel Balinski:
Admissions and Recruitment. Am. Math. Mon. 110(5): 386-399 (2003) - 2002
- [j8]Mourad Baïou, Michel Balinski:
The Stable Allocation (or Ordinal Transportation) Problem. Math. Oper. Res. 27(3): 485-503 (2002) - [j7]Mourad Baïou, Michel Balinski:
Erratum: The Stable Allocation (or Ordinal Transportation) Problem. Math. Oper. Res. 27(4): 662-680 (2002) - [j6]Mourad Baïou, Ali Ridha Mahjoub:
The Steiner Traveling Salesman Polytope and Related Polyhedra. SIAM J. Optim. 13(2): 498-507 (2002) - 2001
- [j5]Mourad Baïou:
On the dominant of the Steiner 2-edge connected subgraph polytope. Discret. Appl. Math. 112(1-3): 3-10 (2001) - 2000
- [j4]Mourad Baïou, Michel Balinski:
Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry). Discret. Appl. Math. 101(1-3): 1-12 (2000) - [j3]Mourad Baïou, Francisco Barahona, Ali Ridha Mahjoub:
Separation of Partition Inequalities. Math. Oper. Res. 25(2): 243-254 (2000) - [j2]Mourad Baïou, Michel Balinski:
The stable admissions polytope. Math. Program. 87(3): 427-439 (2000)
1990 – 1999
- 1997
- [j1]Mourad Baïou, Ali Ridha Mahjoub:
Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs. SIAM J. Discret. Math. 10(3): 505-514 (1997)
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-10-07 21:22 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: