The following pages link to Mourad Baïou (Q210495):
Displaying 49 items.
- Stackelberg bipartite vertex cover and the preflow algorithm (Q270027) (← links)
- On the linear relaxation of the \(p\)-median problem (Q429694) (← links)
- Faster algorithms for security games on matroids (Q666676) (← links)
- On the nucleolus of shortest path games (Q681844) (← links)
- On the \(p\)-median polytope of \(Y\)-free graphs (Q951093) (← links)
- The stable admissions polytope (Q1575067) (← links)
- The stop number minimization problem: complexity and polyhedral analysis (Q1661860) (← links)
- On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs (Q1751184) (← links)
- On a connection between facility location and perfect graphs (Q1785286) (← links)
- Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem (Q1800990) (← links)
- Student admissions and faculty recruitment (Q1885915) (← links)
- Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry) (Q1975360) (← links)
- An algorithm to compute the nucleolus of shortest path games (Q1999962) (← links)
- Network disconnection games: a game theoretic approach to checkpoint evaluation in networks (Q2064296) (← links)
- On some algorithmic aspects of hypergraphic matroids (Q2099466) (← links)
- The complexity of the unit stop number problem and its implications to other related problems (Q2136280) (← links)
- On the \(p\)-median polytope and the directed odd cycle inequalities (Q2225045) (← links)
- Network strength games: the core and the nucleolus (Q2297643) (← links)
- Bounds on directed star arboricity in some digraph classes (Q2413182) (← links)
- Characterizations of the optimal stable allocation mechanism (Q2467483) (← links)
- The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation (Q2506819) (← links)
- Separation of Partition Inequalities (Q2757634) (← links)
- Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs (Q2813347) (← links)
- Hardness and Algorithms for Variants of Line Graphs of Directed Graphs (Q2872084) (← links)
- On the p-median polytope of fork-free graphs (Q2883561) (← links)
- On the Location and p-Median Polytopes (Q2971602) (← links)
- On the <i>p</i>-Median Polytope and the Intersection Property: Polyhedra and Algorithms (Q3094898) (← links)
- (Q3109933) (← links)
- Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem (Q3186492) (← links)
- The Dominating Set Polytope via Facility Location (Q3195312) (← links)
- (Q3439669) (← links)
- A linear programming approach to increasing the weight of all minimum spanning trees (Q3548723) (← links)
- On the Integrality of Some Facility Location Polytopes (Q3563933) (← links)
- Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs (Q4377432) (← links)
- On the <i>p</i>‐median polytope and the odd directed cycle inequalities: Oriented graphs (Q4584866) (← links)
- The Steiner Traveling Salesman Polytope and Related Polyhedra (Q4785891) (← links)
- On the star forest polytope for trees and cycles (Q5214329) (← links)
- A polyhedral study of a two level facility location model (Q5418010) (← links)
- Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs (Q5418987) (← links)
- The Stable Allocation (or Ordinal Transportation) Problem (Q5704093) (← links)
- Erratum: The Stable Allocation (or Ordinal Transportation) Problem (Q5704102) (← links)
- On the dominant of the Steiner 2-edge connected subgraph polytope (Q5946813) (← links)
- A note on many-to-many matchings and stable allocations (Q5962526) (← links)
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422) (← links)
- Complexity, algorithmic, and computational aspects of a dial-a-ride type problem (Q6113356) (← links)
- A branch-and-cut algorithm for the balanced traveling salesman problem (Q6123381) (← links)
- Generalized nash fairness solutions for bi‐objective minimization problems (Q6180043) (← links)
- Proportional fairness for combinatorial optimization (Q6547965) (← links)
- A project and lift approach for a 2-commodity flow relocation model in a time expanded network (Q6585274) (← links)
