Skip to main content

previous disabled Page of 2
and
  1. No Access

    Article

    Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem

    The Constrained-Routing and Spectrum Assignment (C-RSA) problem arises in the design of 5G telecommunication optical networks. Given an undirected, loopless, and connected graph G, an optical spectrum of availabl...

    Ibrahima Diarrassouba, Youssouf Hadhbi in Journal of Combinatorial Optimization (2024)

  2. No Access

    Article

    On the minimum \(s-t\) cut problem with budget constraints

    We consider in this paper the budgeted minimum \(s-t\) s - ...

    Hassene Aissi, A. Ridha Mahjoub in Mathematical Programming (2024)

  3. No Access

    Book and Conference Proceedings

    Combinatorial Optimization

    7th International Symposium, ISCO 2022, Virtual Event, May 18–20, 2022, Revised Selected Papers

    Ivana Ljubić, Francisco Barahona in Lecture Notes in Computer Science (2022)

  4. No Access

    Article

    Preface: New trends on combinatorial optimization for network and logistical applications

    Imed Kacem, Hans Kellerer, A. Ridha Mahjoub in Annals of Operations Research (2021)

  5. No Access

    Article

    The Multiple Steiner TSP with order constraints: complexity and optimization algorithms

    We consider a variant of the Travelling Salesman Problem (TSP), the Multiple Steiner TSP with Order constraints (MSTSPO). Consider a weighted undirected graph and a set of salesmen, and each salesman is associ...

    Virginie Gabrel, A. Ridha Mahjoub, Raouia Taktak, Eduardo Uchoa in Soft Computing (2020)

  6. No Access

    Book and Conference Proceedings

    Combinatorial Optimization

    6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020, Revised Selected Papers

    Mourad Baïou, Bernard Gendron, Oktay Günlük in Lecture Notes in Computer Science (2020)

  7. No Access

    Chapter and Conference Paper

    On the Linear Relaxation of the \(s-t\) -cut Problem with Budget Constraints

    We consider in this paper a generalization of the minimum \(s-t\) cut problem. Suppose we are given a directed graph

    Hassene Aissi, A. Ridha Mahjoub in Combinatorial Optimization (2020)

  8. No Access

    Article

    A parallel hybrid optimization algorithm for some network design problems

    Network design problems have been widely studied in the last decades due to the importance of ICT in our daily life and are still the subject of extensive researches. Network design covers a large family of pr...

    Ibrahima Diarrassouba, Mohamed Khalil Labidi, A. Ridha Mahjoub in Soft Computing (2019)

  9. Article

    Preface: The fourth International Symposium on Combinatorial Optimization (ISCO) 2016

    Satoru Fujishige, A. Ridha Mahjoub, Franz Rendl in Journal of Combinatorial Optimization (2019)

  10. No Access

    Article

    Optimization algorithms for the disjunctively constrained knapsack problem

    This paper deals with the Knapsack Problem with conflicts, also known as the Disjunctively Constrained Knapsack Problem. The conflicts are represented by a graph whose vertices are the items such that adjacent...

    Mariem Ben Salem, Raouia Taktak, A. Ridha Mahjoub, Hanêne Ben-Abdallah in Soft Computing (2018)

  11. No Access

    Article

    k-node-disjoint hop-constrained survivable networks: polyhedral analysis and branch and cut

    Given a graph with weights on the edges, a set of origin and destination pairs of nodes, and two integers L ≥ 2 and k ≥ 2, the k-node-disjoint hop-constrained network design problem is to find a minimum weight su...

    Ibrahima Diarrassouba, Meriem Mahjoub, A. Ridha Mahjoub in Annals of Telecommunications (2018)

  12. No Access

    Article

    Assessing the risk of complex ICT systems

    ICT systems are becoming increasingly complex and dynamic. They mostly include a large number of heterogeneous and interconnected assets (both physically and logically), which may be in turn exposed to multipl...

    Nizar Kheir, A. Ridha Mahjoub, M. Yassine Naghmouchi in Annals of Telecommunications (2018)

  13. No Access

    Book and Conference Proceedings

    Combinatorial Optimization

    5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11–13, 2018, Revised Selected Papers

    Jon Lee, Giovanni Rinaldi, A. Ridha Mahjoub in Lecture Notes in Computer Science (2018)

  14. Chapter and Conference Paper

    Correction to: Combinatorial Optimization

    Jon Lee, Giovanni Rinaldi, A. Ridha Mahjoub in Combinatorial Optimization (2018)

  15. No Access

    Book and Conference Proceedings

    Combinatorial Optimization

    4th International Symposium, ISCO 2016, Vietri sul Mare, Italy, May 16-18, 2016, Revised Selected Papers

    Raffaele Cerulli, Satoru Fujishige in Lecture Notes in Computer Science (2016)

  16. No Access

    Article

    Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs

    We consider multiobjective and parametric versions of the global minimum cut problem in undirected graphs and bounded-rank hypergraphs with multiple edge cost functions. For a fixed number of edge cost functio...

    Hassene Aissi, A. Ridha Mahjoub, S. Thomas McCormick in Mathematical Programming (2015)

  17. Article

    Preface

    A. Ridha Mahjoub, Giovanni Rinaldi, Gerhard Woeginger in Mathematical Programming (2015)

  18. No Access

    Book and Conference Proceedings

    Combinatorial Optimization

    Third International Symposium, ISCO 2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers

    Pierre Fouilhoux, Luis Eduardo Neves Gouveia in Lecture Notes in Computer Science (2014)

  19. No Access

    Chapter and Conference Paper

    A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts

    We investigate the bicriteria global minimum cut problem where each edge is evaluated by two nonnegative cost functions. The parametric complexity of such a problem is the number of linear segments in the paramet...

    Hassene Aissi, A. Ridha Mahjoub in Integer Programming and Combinatorial Opti… (2014)

  20. No Access

    Article

    Solving VLSI design and DNA sequencing problems using bipartization of graphs

    In this paper we consider the 2-layer constrained via minimization problem and the SNP haplotype assembly problem. The former problem arises in the design of integrated and printed circuit boards, and the latt...

    Pierre Fouilhoux, A. Ridha Mahjoub in Computational Optimization and Applications (2012)

previous disabled Page of 2