default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHervé Kerivin
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Victoria Kaial, Hervé Kerivin, Annegret Katrin Wagler
:
On non-superperfection of edge intersection graphs of paths. Discret. Optim. 54: 100857 (2024)- [j25]Pedro Henrique Fernandes da Silva, Hervé Kerivin, Juan Pablo Nant, Annegret Katrin Wagler:
Solving the routing and spectrum assignment problem, driven by combinatorial properties. Networks 83(2): 390-407 (2024) - 2023
- [j24]Mourad Baïou, Rafael Colares, Hervé Kerivin:
Complexity, algorithmic, and computational aspects of a dial-a-ride type problem. Eur. J. Oper. Res. 310(2): 552-565 (2023) - [j23]Hussein Chouman, Luay Alahdab, Rafael Colares, Annie Gravey, Philippe Gravey, Hervé Kerivin, Michel Morvan:
Practical methods for allocating and assessing resources in flexgrid networks. JOCN 15(11): 883-899 (2023) - [c4]Federico Bertero, Hervé Kerivin, Javier Marenco, Annegret Wagler:
A polyhedral study of a relaxation of the routing and spectrum allocation problem (Brief Announcement). LAGOS 2023: 391-393 - 2022
- [j22]Hervé Kerivin, Jinhua Zhao:
A computational study on the Maximum-Weight Bounded-Degree Rooted Tree Problem. Appl. Math. Comput. 413: 126623 (2022) - [j21]Hervé L. M. Kerivin, Jinhua Zhao:
Bounded-degree rooted tree and TDI-ness. RAIRO Oper. Res. 56(4): 2181-2201 (2022) - [j20]Mourad Baïou, Rafael Colares, Hervé Kerivin:
The complexity of the unit stop number problem and its implications to other related problems. Theor. Comput. Sci. 919: 36-46 (2022)
2010 – 2019
- 2019
- [c3]Youssouf Hadhbi, Hervé Kerivin, Annegret Wagler:
A novel integer linear programming model for routing and spectrum assignment in optical networks. FedCSIS 2019: 127-134 - 2018
- [j19]Erin K. Doolittle, Hervé L. M. Kerivin, Margaret M. Wiecek:
Robust multiobjective optimization with application to Internet routing. Ann. Oper. Res. 271(2): 487-525 (2018) - [j18]Denis Cornaz, Hervé Kerivin, Ali Ridha Mahjoub:
Minimal arc-sets spanning dicycles. Discret. Appl. Math. 240: 33-43 (2018) - [j17]Graciela L. Nasini, Luis Miguel Torres, Hervé Kerivin, Annegret Wagler:
On the Chvátal-rank of facets for the set covering polyhedron of circular matrices. Electron. Notes Discret. Math. 69: 85-92 (2018) - [c2]Mourad Baïou, Rafael Colares, Hervé Kerivin:
The Stop Number Minimization Problem: Complexity and Polyhedral Analysis. ISCO 2018: 64-76 - 2015
- [j16]Mohamed Didi Biha, Hervé L. M. Kerivin, Peh H. Ng:
Polyhedral study of the connected subgraph problem. Discret. Math. 338(1): 80-92 (2015) - 2014
- [c1]Hervé Kerivin, Jinhua Zhao:
Polyhedral study for the maximum bounded r-tree problem. CoDIT 2014: 140-145 - 2012
- [j15]Hervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub:
Models for the single-vehicle preemptive pickup and delivery problem. J. Comb. Optim. 23(2): 196-223 (2012) - [j14]Hervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub:
On the complexity of the Eulerian closed walk with precedence path constraints problem. Theor. Comput. Sci. 439: 16-29 (2012) - 2011
- [j13]Hervé Kerivin, Mathieu Lacroix, Alain Quilliot, Hélène Toussaint:
Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem. RAIRO Oper. Res. 45(3): 179-207 (2011) - [i2]Hervé Kerivin, Jimmy Leblet, Gwendal Simon, Fen Zhou:
Maximum Bounded Rooted-Tree Packing Problem. CoRR abs/1111.0706 (2011) - 2010
- [j12]Alain Quilliot, Mathieu Lacroix, Hélène Toussaint, Hervé Kerivin:
Tree based heuristics for the preemptive asymmetric stacker crane problem. Electron. Notes Discret. Math. 36: 41-48 (2010) - [j11]Hervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub:
On the complexity of the Eulerian closed walk with precedence path constraints problem. Electron. Notes Discret. Math. 36: 899-906 (2010)
2000 – 2009
- 2009
- [i1]Jacob Chakareski, Pascal Frossard, Hervé Kerivin, Jimmy Leblet, Gwendal Simon:
A note on the data-driven capacity of P2P networks. CoRR abs/0909.3122 (2009) - 2008
- [j10]Mohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub:
On the Polytope of the (1, 2)-Survivable Network Design Problem. SIAM J. Discret. Math. 22(4): 1640-1666 (2008) - 2007
- [j9]Renaud Sirdey, Jacques Carlier, Hervé Kerivin, Dritan Nace:
On a resource-constrained scheduling problem with application to distributed systems reconfiguration. Eur. J. Oper. Res. 183(2): 546-563 (2007) - [j8]Renaud Sirdey, Hervé Kerivin:
A branch-and-cut algorithm for a resource-constrained scheduling problem. RAIRO Oper. Res. 41(3): 235-251 (2007) - 2005
- [j7]Hervé Kerivin, Ali Ridha Mahjoub:
On survivable network polyhedra. Discret. Math. 290(2/3): 183-210 (2005) - [j6]Hervé Kerivin, Ali Ridha Mahjoub:
Design of Survivable Networks: A survey. Networks 46(1): 1-21 (2005) - [j5]Hervé Kerivin, Dritan Nace, Thi-Tuyet-Loan Pham:
Design of capacitated survivable networks with a single facility. IEEE/ACM Trans. Netw. 13(2): 248-261 (2005) - 2004
- [j4]Francisco Barahona, Hervé Kerivin:
Separation of partition inequalities with terminals. Discret. Optim. 1(2): 129-140 (2004) - [p1]Hervé Kerivin, Ali Ridha Mahjoub, Charles Nocq:
(1, 2)-Survivable Networks: Facets and Branch-and-Cut. The Sharpest Cut 2004: 121-152 - 2003
- [j3]Walid Ben-Ameur, Hervé Kerivin:
Networks new economical virtual private. Commun. ACM 46(6): 69-73 (2003) - 2002
- [j2]Hervé Kerivin, Ali Ridha Mahjoub:
Separation of partition inequalities for the (1, 2)-survivable network design problem. Oper. Res. Lett. 30(4): 265-268 (2002) - 2001
- [j1]Mohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub:
Steiner trees and polyhedra. Discret. Appl. Math. 112(1-3): 101-120 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 01:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
