A computational study on the Maximum-Weight Bounded-Degree Rooted Tree Problem von Kerivin, Hervé, Zhao, Jinhua

Volltext

Complexity, algorithmic, and computational aspects of a dial-a-ride type problem von Baïou, Mourad, Colares, Rafael, Kerivin, Hervé

Volltext

The complexity of the unit stop number problem and its implications to other related problems von Baïou, Mourad, Colares, Rafael, Kerivin, Hervé

Volltext

Practical methods for allocating and assessing resources in flexgrid networks von Chouman, Hussein, Alahdab, Luay, Colares, Rafael, Gravey, Annie, Gravey, Philippe, Kerivin, Herve, Morvan, Michel

Volltext

On non-superperfection of edge intersection graphs of paths von Kaial, Victoria, Kerivin, Hervé, Wagler, Annegret K.

Volltext

The Stop Number Minimization Problem: Complexity and Polyhedral Analysis von Baïou, Mourad, Colares, Rafael, Kerivin, Hervé

Volltext

Solving the routing and spectrum assignment problem, driven by combinatorial properties von Silva, Pedro Henrique Fernandes, Kerivin, Hervé, Nant, Juan Pablo, Wagler, Annegret K.

Volltext

Robust multiobjective optimization with application to Internet routing von Doolittle, Erin K., Kerivin, Hervé L. M., Wiecek, Margaret M.

Volltext

A novel integer linear programming model for routing and spectrum assignment in optical networks von Hadhbi, Youssouf, Kerivin, Herve, Wagler, Annegret

Volltext

On a resource-constrained scheduling problem with application to distributed systems reconfiguration von Sirdey, Renaud, Carlier, Jacques, Kerivin, Hervé, Nace, Dritan

Volltext

Models for the single-vehicle preemptive pickup and delivery problem von Kerivin, H. L. M., Lacroix, M., Mahjoub, A. R.

Volltext

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

Volltext

A polyhedral study of a relaxation of the routing and spectrum allocation problem (Brief Announcement) von Bertero, Federico, Kerivin, Herve, Marenco, Javier, Wagler, Annegret

Volltext

On the Polytope of the (1,2)-Survivable Network Design Problem von Biha, Mohamed Didi, Kerivin, Hervé, Mahjoub, A. Ridha

Volltext

Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem von Kerivin, Hervé, Lacroix, Mathieu, Quilliot, Alain, Toussaint, Hélène

Volltext

Polyhedral study of the connected subgraph problem von Didi Biha, Mohamed, Kerivin, Hervé L.M., Ng, Peh H.

Volltext

Design of capacitated survivable networks with a single Facility von Kerivin, H., Nace, D., Pham, T.-T.-L.

Volltext

Minimal arc-sets spanning dicycles von Cornaz, D., Kerivin, H., Mahjoub, A.R.

Volltext

A branch-and-cut algorithm for a resource-constrained scheduling problem von Sirdey, Renaud, Kerivin, Hervé L. M.

Volltext

Routing of Uncertain Traffic Demands von Ben-Ameur, Walid, Kerivin, Hervé

Volltext