4OR

4OR OnlineFirst articles

10.01.2019 | Research Paper

Finite horizon risk-sensitive continuous-time Markov decision processes with unbounded transition and cost rates

We consider a risk-sensitive continuous-time Markov decision process over a finite time duration. Under the conditions that can be satisfied by unbounded transition and cost rates, we show the existence of an optimal policy, and the existence and …

07.01.2019 | PhD Thesis

A comparative study of labeling algorithms within the branch-and-price framework for vehicle routing with time windows

01.01.2019 | Research Paper

A GRASP algorithm for multi container loading problems with practical constraints

We consider the multicontainer loading problem of a company that has to serve its customers by first putting the products on pallets and then loading pallets onto trucks. When a large number of units of a product have to be shipped, the company …

29.11.2018 | PhD Thesis

The trade-off between inventories, lead time and capacity: application to vaccine supply chain design

27.11.2018 | Research Paper

An exact algorithm for the minimum quartet tree cost problem

The minimum quartet tree cost (MQTC) problem is a graph combinatorial optimization problem where, given a set of $$n \ge 4$$ n ≥ 4 data objects and their pairwise costs (or distances), one wants to construct an optimal tree from the $$3 \cdot {n …

Weitere Informationen

Titel

4OR

Verlag

Springer Berlin Heidelberg

Abdeckung

Jahrgang 1/2003 - Jahrgang 16/2018

Print ISSN

1619-4500

Elektronische ISSN

1614-2411

DOI

https://doi.org/10.1007/10288.1614-2411

Zeitschriften-ID

10288