default search action
Pierre Hosteins
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i3]Alberto Boggio Tomasaz, Margarida Carvalho, Roberto Cordone, Pierre Hosteins:
On the completeness of several fortification-interdiction games in the Polynomial Hierarchy. CoRR abs/2406.01756 (2024) - 2023
- [j18]Alberto Boggio Tomasaz
, Roberto Cordone
Constructive-destructive heuristics for the Safe Set Problem. Comput. Oper. Res. 159: 106311 (2023) - [j17]Alberto Boggio Tomasaz
A combinatorial branch and bound for the safe set problem. Networks 81(4): 445-464 (2023) - [c1]Reza Shahin, Pierre Hosteins, Paola Pellegrini, Pierre-Olivier Vandanjon:
A full factorial sensitivity analysis for a capacitated Flex-Route Transit system. MT-ITS 2023: 1-6 - 2022
- [j16]Adel Nabli
Complexity of the multilevel critical node problem. J. Comput. Syst. Sci. 127: 122-145 (2022) - [j15]Pierre Hosteins
The Connected Critical Node Problem. Theor. Comput. Sci. 923: 235-255 (2022) - 2020
- [j14]Pierre Hosteins
The stochastic critical node problem over trees. Networks 76(3): 381-401 (2020) - [j13]Pierre Hosteins
A compact mixed integer linear formulation for safe set problems. Optim. Lett. 14(8): 2127-2148 (2020) - [i2]Adel Nabli, Margarida Carvalho, Pierre Hosteins:
Complexity of the Multilevel Critical Node Problem. CoRR abs/2007.02370 (2020)
2010 – 2019
- 2019
- [j12]Roberto Cordone, Pierre Hosteins:
A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization. Comput. Oper. Res. 102: 130-140 (2019) - [j11]Roberto Aringhieri
Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem. Discret. Appl. Math. 253: 103-121 (2019) - 2018
- [j10]Roberto Aringhieri
Simple but effective heuristics for the 2-constraint bin packing problem. J. Heuristics 24(3): 345-357 (2018) - [j9]Roberto Cordone, Pierre Hosteins
A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization. INFORMS J. Comput. 30(1): 168-180 (2018) - [i1]Pierre Hosteins, Rosario Scatamacchia:
The Stochastic Critical Node Problem over Trees. CoRR abs/1812.06456 (2018) - 2016
- [j8]Bernardetta Addis
Hybrid constructive heuristics for the critical node problem. Ann. Oper. Res. 238(1-2): 637-649 (2016) - [j7]Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia:
A general Evolutionary Framework for different classes of Critical Node Problems. Eng. Appl. Artif. Intell. 55: 128-145 (2016) - [j6]Roberto Aringhieri
A Genetic Algorithm for a class of Critical Node Problems. Electron. Notes Discret. Math. 52: 359-366 (2016) - [j5]Roberto Aringhieri
A preliminary analysis of the Distance Based Critical Node Problem. Electron. Notes Discret. Math. 55: 25-28 (2016) - [j4]Pierre Hosteins, Roberto Cordone, Giovanni Righini
The Prize-collecting Scheduling Problem with Deadlines. Electron. Notes Discret. Math. 55: 57-60 (2016) - [j3]Roberto Aringhieri
Local search metaheuristics for the critical node problem. Networks 67(3): 209-221 (2016) - 2015
- [j2]Roberto Aringhieri
VNS solutions for the Critical Node Problem. Electron. Notes Discret. Math. 47: 37-44 (2015) - 2014
- [j1]Roberto Cordone, Pierre Hosteins, Giovanni Righini
Optimal selection of contracts and work shifts in multi-skill call centers. EURO J. Comput. Optim. 2(4): 247-277 (2014)
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-07-05 20:15 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: