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

Solving a Truck Dispatching Scheduling Problem Using Branch-and-Cut

A branch-and-cut IP solver is developed for a class of structured 0/1 integer programs arising from a truck dispatching scheduling problem. This problem involves a special class of knapsack equality ...
The Boston Globe

Denied by AI: How Medicare Advantage plans use algorithms to cut off care for seniors in need

This is an excerpt from STAT, the health and medicine news site that’s a partner to the Globe. For a full version of this story and related coverage, visit STAT. An algorithm, not a doctor, predicted ...