PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Hosteins, Pierre"

Author of the publication

copydeleteadd this publication to your clipboard
Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem.

, , , and . Discrete Applied Mathematics, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Pierre Nacke University of Stuttgart

Dr. rer. nat. Pierre Eckold University of Stuttgart

Pierre Kuna University of Stuttgart

 

Other publications of authors with the same name

VNS solutions for the Critical Node Problem., , , and . Electron. Notes Discret. Math., (2015)Hybrid constructive heuristics for the critical node problem., , , and . Annals OR, 238 (1-2): 637-649 (2016)The Prize-collecting Scheduling Problem with Deadlines., , and . Electron. Notes Discret. Math., (2016)A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization., , and . INFORMS J. Comput., 30 (1): 168-180 (2018)A preliminary analysis of the Distance Based Critical Node Problem., , , and . Electron. Notes Discret. Math., (2016)Local search metaheuristics for the critical node problem., , , and . Networks, 67 (3): 209-221 (2016)A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization., and . Computers & OR, (2019)The Stochastic Critical Node Problem over Trees., and . CoRR, (2018)Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem., , , and . Discrete Applied Mathematics, (2019)A Genetic Algorithm for a class of Critical Node Problems., , and . Electron. Notes Discret. Math., (2016)