Hervé L. M. Kerivin

Available identifiers

zbMath Open kerivin.herve-l-mMaRDI QIDQ421256

List of research outcomes

Publication	Date of Publication	Type
On non-superperfection of edge intersection graphs of paths	2025-01-23	Paper
Solving the routing and spectrum assignment problem, driven by combinatorial properties	2024-03-15	Paper
Complexity, algorithmic, and computational aspects of a dial-a-ride type problem	2023-07-11	Paper
Bounded-degree rooted tree and TDI-Ness	2022-09-15	Paper
The complexity of the unit stop number problem and its implications to other related problems	2022-05-10	Paper
On superperfection of edge intersection graphs of paths	2021-12-08	Paper
A computational study on the maximum-weight bounded-degree rooted tree problem	2021-11-16	Paper
Robust multiobjective optimization with application to Internet routing	2019-03-06	Paper
The stop number minimization problem: complexity and polyhedral analysis	2018-08-17	Paper
Minimal arc-sets spanning dicycles	2018-04-04	Paper
Polyhedral study of the connected subgraph problem	2014-11-07	Paper
On the complexity of the Eulerian closed walk with precedence path constraints problem	2013-11-08	Paper
Tree based models and algorithms for the preemptive asymmetric stacker crane problem	2012-09-04	Paper
On the complexity of the Eulerian closed walk with precedence path constraints problem	2012-08-08	Paper
Models for the single-vehicle preemptive pickup and delivery problem	2012-05-23	Paper
Tree based heuristics for the preemptive asymmetric stacker crane problem	2012-05-13	Paper
A branch-and-cut algorithm for a resource-constrained scheduling problem	2011-06-01	Paper
On the Polytope of the (1,2)-Survivable Network Design Problem	2009-11-27	Paper
Routing of uncertain traffic demands	2009-08-12	Paper
On a resource-constrained scheduling problem with application to distributed systems reconfiguration	2007-07-04	Paper
Design of Survivable Networks: A survey	2005-09-22	Paper
https://portal.mardi4nfdi.de/entity/Q5465113	2005-08-22	Paper
Separation of partition inequalities with terminals	2005-08-22	Paper
On survivable network polyhedra	2005-04-18	Paper
Separation of partition inequalities for the \((1,2)\)-survivable network design problem	2003-04-03	Paper
Steiner trees and polyhedra	2002-07-30	Paper

Research outcomes over time

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