Hervé L. M. Kerivin

From MaRDI portal
Person:421256

Available identifiers

zbMath Open kerivin.herve-l-mMaRDI QIDQ421256

List of research outcomes





PublicationDate of PublicationType
On non-superperfection of edge intersection graphs of paths2025-01-23Paper
Solving the routing and spectrum assignment problem, driven by combinatorial properties2024-03-15Paper
Complexity, algorithmic, and computational aspects of a dial-a-ride type problem2023-07-11Paper
Bounded-degree rooted tree and TDI-Ness2022-09-15Paper
The complexity of the unit stop number problem and its implications to other related problems2022-05-10Paper
On superperfection of edge intersection graphs of paths2021-12-08Paper
A computational study on the maximum-weight bounded-degree rooted tree problem2021-11-16Paper
Robust multiobjective optimization with application to Internet routing2019-03-06Paper
The stop number minimization problem: complexity and polyhedral analysis2018-08-17Paper
Minimal arc-sets spanning dicycles2018-04-04Paper
Polyhedral study of the connected subgraph problem2014-11-07Paper
On the complexity of the Eulerian closed walk with precedence path constraints problem2013-11-08Paper
Tree based models and algorithms for the preemptive asymmetric stacker crane problem2012-09-04Paper
On the complexity of the Eulerian closed walk with precedence path constraints problem2012-08-08Paper
Models for the single-vehicle preemptive pickup and delivery problem2012-05-23Paper
Tree based heuristics for the preemptive asymmetric stacker crane problem2012-05-13Paper
A branch-and-cut algorithm for a resource-constrained scheduling problem2011-06-01Paper
On the Polytope of the (1,2)-Survivable Network Design Problem2009-11-27Paper
Routing of uncertain traffic demands2009-08-12Paper
On a resource-constrained scheduling problem with application to distributed systems reconfiguration2007-07-04Paper
Design of Survivable Networks: A survey2005-09-22Paper
https://portal.mardi4nfdi.de/entity/Q54651132005-08-22Paper
Separation of partition inequalities with terminals2005-08-22Paper
On survivable network polyhedra2005-04-18Paper
Separation of partition inequalities for the \((1,2)\)-survivable network design problem2003-04-03Paper
Steiner trees and polyhedra2002-07-30Paper

Research outcomes over time

This page was built for person: Hervé L. M. Kerivin