Search Results - Mahjoub, A. Ridha

Refine Results
  1. 1
    Preface: Combinatorial Optimization ISCO 2018

    Preface: Combinatorial Optimization ISCO 2018 by Lee, Jon, Ridha Mahjoub, A., Rinaldi, Giovanni

    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    On the minimum s-t cut problem with budget constraints

    On the minimum s-t cut problem with budget constraints by Aissi, Hassene, Mahjoub, A. Ridha

    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  3. 3
    Combinatorial optimization model and MIP formulation for the structural analysis of conditional differential-algebraic systems

    Combinatorial optimization model and MIP formulation for the structural analysis of conditional differential-algebraic systems by Lacroix, Mathieu, Ridha Mahjoub, A., Martin, Sébastien

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  4. 4
    Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems

    Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems by Liguori, Pedro Henrique, Mahjoub, A. Ridha, Marques, Guillaume, Sadykov, Ruslan, Uchoa, Eduardo

    Published in Operations research
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  5. 5
    A Branch-and-Cut Algorithm for the Alternative Fuel Refueling Station Location Problem with Routing

    A Branch-and-Cut Algorithm for the Alternative Fuel Refueling Station Location Problem with Routing by Arslan, Okan, Karaşan, Oya Ekin, Mahjoub, A. Ridha, Yaman, Hande

    Published in Transportation science
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  6. 6
    Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem

    Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem by Diarrassouba, Ibrahima, Hadhbi, Youssouf, Mahjoub, A. Ridha

    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  7. 7
    Design of survivable networks with low connectivity requirements

    Design of survivable networks with low connectivity requirements by Almathkour, Fatmah, Magnouche, Youcef, Mahjoub, A. Ridha, Taktak, Raouia

    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  8. 8
    Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation

    Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation by Mahjoub, A. Ridha, McCormick, S. Thomas

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  9. 9
    Distance Transformation for Network Design Problems

    Distance Transformation for Network Design Problems by Mahjoub, A. Ridha, Poss, Michael, Simonetti, Luidi, Uchoa, Eduardo

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  10. 10
    Preface: New trends on combinatorial optimization for network and logistical applications

    Preface: New trends on combinatorial optimization for network and logistical applications by Kacem, Imed, Kellerer, Hans, Mahjoub, A. Ridha

    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Preface: The fourth International Symposium on Combinatorial Optimization (ISCO) 2016

    Preface: The fourth International Symposium on Combinatorial Optimization (ISCO) 2016 by Fujishige, Satoru, Mahjoub, A. Ridha, Rendl, Franz

    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut

    The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut by Huygens, David, Labbé, Martine, Mahjoub, A. Ridha, Pesneau, Pierre

    Published in Networks
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  13. 13
    Capacitated Multi-Layer Network Design with Unsplittable Demands: Polyhedra and Branch-and-Cut

    Capacitated Multi-Layer Network Design with Unsplittable Demands: Polyhedra and Branch-and-Cut by Benhamiche, Amal, Mahjoub, A. Ridha, Perrot, Nancy, Uchoa, Eduardo

    Published in Discrete optimization
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  14. 14
    Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs

    Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs by Aissi, Hassene, Mahjoub, A. Ridha, McCormick, S. Thomas, Queyranne, Maurice

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  15. 15
    Integer programming formulations for the two 4-hop-constrained paths problem

    Integer programming formulations for the two 4-hop-constrained paths problem by Huygens, David, Ridha Mahjoub, A.

    Published in Networks
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  16. 16
    Design of Survivable Networks: A survey

    Design of Survivable Networks: A survey by Kerivin, Hervé, Mahjoub, A. Ridha

    Published in Networks
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  17. 17
    k-node-disjoint hop-constrained survivable networks: polyhedral analysis and branch and cut

    k-node-disjoint hop-constrained survivable networks: polyhedral analysis and branch and cut by Diarrassouba, Ibrahima, Mahjoub, Meriem, Mahjoub, A. Ridha, Yaman, Hande

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  18. 18
    Unsplittable non-additive capacitated network design using set functions polyhedra

    Unsplittable non-additive capacitated network design using set functions polyhedra by Benhamiche, Amal, Mahjoub, A. Ridha, Perrot, Nancy, Uchoa, Eduardo

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  19. 19
    Two node-disjoint hop-constrained survivable network design and polyhedra

    Two node-disjoint hop-constrained survivable network design and polyhedra by Diarrassouba, Ibrahima, Kutucu, Hakan, Mahjoub, A. Ridha

    Published in Networks
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  20. 20
    Critical extreme points of the 2-edge connected spanning subgraph polytope

    Critical extreme points of the 2-edge connected spanning subgraph polytope by FONLUPT, Jean, RIDHA MAHJOUB, A

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:

Search Tools: