The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route planning ...

We develop new algorithmic approaches to compute provably near-optimal policies for multiperiod stochastic lot-sizing inventory models with positive lead times, general demand distributions, and ...

This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms find approximate (slightly suboptimal) solutions to optimization ...

Abstract. In this paper, we suggest and analysis a viscosity iterative algorithm for finding a common element of the set of solution of a mixed equilibrium problem and the set the of solutions of a ...

A team of computer scientists has come up with a dramatically faster algorithm for one of the oldest problems in computer science: maximum flow. The problem asks how much material can flow through a ...