This is a preview. Log in through your library . Abstract This paper proposes models and algorithms for the pickup and delivery vehicle routing problem with time windows and last-in-first-out (LIFO) ...

An efficient branch-and-bound algorithm for computing the best-subset regression models is proposed. The algorithm avoids the computation of the whole regression tree that generates all possible ...

Bin packing problems are a class of NP-hard combinatorial optimisation challenges with wide-ranging applications in logistics, manufacturing, cloud computing and scheduling. The fundamental task is to ...