This paper deals with the two-dimensional strip packing problem (2D-SPP) with the order/or multi-drop and vertical stability constraints. The existing exact algorithm that solves this problem is not ...

Determining the least expensive path for a new subway line underneath a metropolis like New York City is a colossal planning challenge—involving thousands of potential routes through hundreds of city ...

Bio-inspired computational methods have gained popularity recently. These methods mimic the seemingly complex behavior of organisms to tackle difficult and often overwhelming problems. For example, ...

The original version of this story appeared in Quanta Magazine. If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle ...

How bees, beer cans and big data all solve the same problem: not enough space. By Steven Strogatz Photo illustrations by Jens Mortensen Each installment of “Math, Revealed” starts with an object, ...

In the Dynamic Bin Packing problem, \(n\) items arrive and depart the system in an online manner, and the goal is to maintain a good packing throughout. We consider the objective of minimizing the ...

The original version of this story appeared in Quanta Magazine. For computer scientists, solving problems is a bit like mountaineering. First they must choose a problem to solve—akin to identifying a ...

Right now, quantum computers are small and error-prone compared to where they’ll likely be in a few years. Even within those limitations, however, there have been regular claims that the hardware can ...

The increasing number of intelligent electrical appliances and home energy management systems provide a big opportunity for demand response services from residential and small commercial buildings to ...