JSTOR Daily

A Branch-and-Cut Algorithm for the Plant-Cycle Location Problem

The Journal of the Operational Research Society, Vol. 55, No. 5 (May, 2004), pp. 513-520 (8 pages) The Plant-Cycle Location Problem (PCLP) is defined on a graph $G=(I ...
JSTOR Daily

Branch and Price and Cut for the Split-Delivery Vehicle Routing Problem with Time Windows and Linear Weight-Related Cost

This paper addresses a new vehicle routing problem that simultaneously involves time windows, split delivery, and linear weight-related cost. This problem is a generalization of the split delivery ...
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 ...
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 ...