UB Paderborn / Katalog / Suche / in CDI

Réarrangement du gène YWHAE dans les sarcomes du stroma endométrial indifférenciés : profil morphologique, immunophénotypique et moléculaire

Annales de pathologie, 2012-11, Vol.32 (5), p.S121-S122

2012

Volltextzugriff (PDF)

A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization

Computers & operations research, 2019-02, Vol.102, p.130-140

2019

Volltextzugriff (PDF)

A compact mixed integer linear formulation for safe set problems

Optimization letters, 2020-11, Vol.14 (8), p.2127-2148

Hosteins, Pierre

2020

Volltextzugriff (PDF)

The stochastic critical node problem over trees

Networks, 2020-10, Vol.76 (3), p.381-401

2020

Volltextzugriff (PDF)

Constructive–destructive heuristics for the Safe Set Problem

Computers & operations research, 2023-11, Vol.159, p.106311, Article 106311

2023

Volltextzugriff (PDF)

Complexity of the multilevel critical node problem

Journal of computer and system sciences, 2022-08, Vol.127, p.122-145

2022

Volltextzugriff (PDF)

Local search metaheuristics for the critical node problem

Networks, 2016-05, Vol.67 (3), p.209-221

2016

Volltextzugriff (PDF)

Train management in freight shunting yards: Formalisation and literature review

IET intelligent transport systems, 2022-10, Vol.16 (10), p.1286-1305

2022

Volltextzugriff (PDF)

A general Evolutionary Framework for different classes of Critical Node Problems

Engineering applications of artificial intelligence, 2016-10, Vol.55, p.128-145

2016

Volltextzugriff (PDF)

The Connected Critical Node Problem

Theoretical computer science, 2022-06, Vol.923, p.235-255

2022

Volltextzugriff (PDF)

Hybrid constructive heuristics for the critical node problem

Annals of operations research, 2016-03, Vol.238 (1-2), p.637-649

2016

Volltextzugriff (PDF)

Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem

Discrete Applied Mathematics, 2019-01, Vol.253, p.103-121

2019

Volltextzugriff (PDF)

A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization

INFORMS journal on computing, 2018-01, Vol.30 (1), p.168-180

2018

Volltextzugriff (PDF)

Automated inversion time selection for black-blood late gadolinium enhancement cardiac imaging in clinical practice

Magma (New York, N.Y.), 2023-12, Vol.36 (6), p.877-885

2023

Volltextzugriff (PDF)

A survey of Flex-Route Transit problem and its link with Vehicle Routing Problem

Transportation research. Part C, Emerging technologies, 2024-01, Vol.158, p.104437, Article 104437

2024

Volltextzugriff (PDF)

A combinatorial branch and bound for the safe set problem

Networks, 2023-06, Vol.81 (4), p.445-464

2023

Volltextzugriff (PDF)

Simple but effective heuristics for the 2-constraint bin packing problem

Journal of heuristics, 2018-06, Vol.24 (3), p.345-357

2018

Volltextzugriff (PDF)

A data-driven decision support tool to improve hospital bed cleaning logistics using discrete event simulation considering operators’ behaviour

Operations research for health care, 2023-12, Vol.39, p.100408, Article 100408

2023

Volltextzugriff (PDF)

Searching singlet extensions of the supersymmetric standard model in $Z_{6−II}$ orbifold compactification of heterotic string

The European physical journal. C, Particles and fields, 2010-08, Vol.68 (3-4), p.539-559

2010

Volltextzugriff (PDF)

A Genetic Algorithm for a class of Critical Node Problems

Electronic notes in discrete mathematics, 2016-06, Vol.52, p.359-366

2016

Volltextzugriff (PDF)

Searching singlet extensions of the supersymmetric standard model in Z sub(6-II) orbifold compactification of heterotic string

The European physical journal. C, Particles and fields, 2010-08, Vol.68 (3-4), p.539-559

2010

Volltextzugriff (PDF)

Searching singlet extensions of the supersymmetric standard model in [Z.sub.6-II] orbifold compactification of heterotic string

The European physical journal. C, Particles and fields, 2010-08, Vol.68 (3-4), p.539

2010

Volltextzugriff (PDF)

VNS solutions for the Critical Node Problem

Electronic notes in discrete mathematics, 2015-02, Vol.47, p.37-44

2015

Volltextzugriff (PDF)

Searching singlet extensions of the supersymmetric standard model in Z 6−II orbifold compactification of heterotic string

The European physical journal. C, Particles and fields, 2010-08, Vol.68 (3-4), p.539-559

2010

Volltextzugriff (PDF)

The Prize-collecting Scheduling Problem with Deadlines

Electronic notes in discrete mathematics, 2016-11, Vol.55, p.57-60

2016

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Réarrangement du gène YWHAE dans les sarcomes du stroma endométrial indifférenciés : profil morphologique, immunophénotypique et moléculaire

A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization

A compact mixed integer linear formulation for safe set problems

The stochastic critical node problem over trees

Constructive–destructive heuristics for the Safe Set Problem

Complexity of the multilevel critical node problem

Local search metaheuristics for the critical node problem

Train management in freight shunting yards: Formalisation and literature review

A general Evolutionary Framework for different classes of Critical Node Problems

The Connected Critical Node Problem

Hybrid constructive heuristics for the critical node problem

Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem

A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization

Automated inversion time selection for black-blood late gadolinium enhancement cardiac imaging in clinical practice

A survey of Flex-Route Transit problem and its link with Vehicle Routing Problem

A combinatorial branch and bound for the safe set problem

Simple but effective heuristics for the 2-constraint bin packing problem

A data-driven decision support tool to improve hospital bed cleaning logistics using discrete event simulation considering operators’ behaviour

Searching singlet extensions of the supersymmetric standard model in $Z_{6−II}$ orbifold compactification of heterotic string

A Genetic Algorithm for a class of Critical Node Problems

Searching singlet extensions of the supersymmetric standard model in Z sub(6-II) orbifold compactification of heterotic string

Searching singlet extensions of the supersymmetric standard model in [Z.sub.6-II] orbifold compactification of heterotic string

VNS solutions for the Critical Node Problem

Searching singlet extensions of the supersymmetric standard model in Z 6−II orbifold compactification of heterotic string

The Prize-collecting Scheduling Problem with Deadlines

Suchergebnisse filtern