128 results on '"Mahjoub, Ali Ridha"'
Search Results
2. Non-Robust Strong Knapsack Cuts for Capacitated Location-Routing and Related Problems
3. The Constrained-Routing and Spectrum Assignment Problem: Extended Formulation and Branch-and-Cut-and-Price Algorithm
4. Hose workload based exact algorithm for the optimal design of virtual private networks
5. Critical Extreme Points of the 2-Edge Connected Spannning Subgraph Polytope
6. Polyhedral Investigation and Branch-and-Cut Algorithm for the Spectrum Assignment Problem
7. On the Facial Structure of the Constrained-Routing and Spectrum Assignment Polyhedron: Part II
8. Valid Inequalities and Branch-and-Cut-and-Price Algorithm for the Constrained-Routing and Spectrum Assignment Problem
9. Valid Inequalities and Branch-and-Cut Algorithm for the Constrained-Routing and Spectrum Assignment Problem
10. Facets of the Bipartite Subgraph Polytope
11. The Maximum Cut Problem
12. Combinatorial Optimization - 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4-6, 2020, Revised Selected PapersLecture Notes in Computer Science 12176, Springer
13. The Maximum Cut Problem
14. Polyhedral Approaches
15. On survivable network polyhedra
16. 9. (1, 2)-Survivable Networks: Facets and Branch-and-Cut
17. Two-edge connected spanning subgraphs and polyhedra
18. Critical Extreme Points of the 2-Edge Connected Spannning Subgraph Polytope
19. A Hybrid Optimization Approach For the Steiner k-Connected Network Design Problem
20. Randomized Contractions for Multiobjective Minimum Cuts
21. Randomized Contractions for Multiobjective Minimum Cuts
22. A Parallel Hybrid Genetic Algorithm for the k-Edge-Connected Hop-Constrained Network Design Problem
23. On the cut polytope
24. Book reviews
25. Facets of the balanced (acyclic) induced subgraph polytope
26. Combinatorial Optimization Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers
27. A branch-and-cut algorithm for the k-edge connected subgraph problem
28. On the star forest polytope
29. Polytope Des Absorbants Dans Une Classe De Graphe a Seuil
30. Simulated evolution based algorithm versus exact method for virtual private network design
31. Polyhedral Approaches
32. Integer programming formulations for the two 4-hop-constrained paths problem
33. The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
34. On the k edge-disjoint 2-hop-constrained paths polytope
35. From constant traffic matrices to hose workload model for VPN tree design
36. Two edge-disjoint HOP-constrained paths and polyhedra
37. Balanced Matrices and the Set-Covering Polytope
38. On a Composition of Independence Systems by Circuit-Identification
39. On the linear relaxation of the 2-node connected subgraph polytope
40. Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
41. Separation of partition inequalities for the (1,2)-survivable network design problem
42. The Steiner Traveling Salesman Polytope and Related Polyhedra
43. Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs
44. On perfectly two-edge connected graphs
45. One-node cutsets and the dominating set polytope
46. On two-connected subgraph polytopes
47. A min-max relation for K3-covers in graphs noncontractible to K5e
48. Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs
49. Compositions of Graphs and Polyhedra II: Stable Sets
50. Compositions of Graphs and Polyhedra III: Graphs with No $W_4 $ Minor
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.