How do you convince people to drive less? When a team of University of California-Berkeley students considered the problem in the city of Berkeley–where traffic is increasing despite the city ...

Since MaxSAT is NP-hard, no algorithm is known to efficiently solve these problems. Here we present a continuous-time analog solver for MaxSAT and show that the scaling of the escape rate, an ...

The traffic assignment problem (TAP) with elastic demands can be formulated as an optimization problem, the objective of which is the sum of a congestion function and a disutility function. We propose ...

We study the weapon target assignment problem under target information uncertainty. We propose three stochastic/robust optimization models that are average case, worst case, and regret oriented. We ...

A group of theoretical physicists has solved half of a 50-year homework assignment —- a calculation of one type of subatomic particle decay aimed at helping to answer the question of why the ...