JSTOR Daily

Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading

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) ...
Nature

Bin Packing Problems and Optimization Algorithms

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 ...
Business Wire

Research and Markets: Deterministic Operations Research: Models and Methods in Linear Optimization Is an Excellent Book for Operations Research of Linear Optimization Courses

DUBLIN--(BUSINESS WIRE)--Research and Markets(http://www.researchandmarkets.com/research/799091/deterministic_oper) has announced the addition of John Wiley and Sons ...
JSTOR Daily

Branch-and-Bound Algorithms for Computing the Best-Subset Regression Models

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 ...