( en | de | ru )

 

Disambiguation of "Hosteins, Pierre"

Author of the publication

copydeleteadd this publication to your clipboard
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)

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 Mattern

Pierre Gottschlich

Pierre Mangold

Pierre Venet

Pierre Nyabyenda

 

Other publications of authors with the same name

VNS solutions for the Critical Node Problem., , , and . Electron. Notes Discret. Math., (2015)A full factorial sensitivity analysis for a capacitated Flex-Route Transit system., , , and . MT-ITS, page 1-6. IEEE, (2023)A general Evolutionary Framework for different classes of Critical Node Problems., , , and . Eng. Appl. Artif. Intell., (2016)A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization., and . Comput. Oper. Res., (2019)Local search metaheuristics for the critical node problem., , , and . Networks, 67 (3): 209-221 (2016)A preliminary analysis of the Distance Based Critical Node Problem., , , 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)The Connected Critical Node Problem., , , and . Theor. Comput. Sci., (2022)A compact mixed integer linear formulation for safe set problems.. Optim. Lett., 14 (8): 2127-2148 (2020)The stochastic critical node problem over trees., and . Networks, 76 (3): 381-401 (2020)