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

Abstract: For a given graph G with distinct vertices s, t and a given delay constraint D ∈ R +, the k-disjoint restricted shortest path (kRSP) problem of computing k-disjoint minimum cost stpaths with ...

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

Abstract: Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc networks have ...

Stochastic approximation algorithms are used to approximate solutions to fixed point equations that involve expectations of functions with respect to possibly unknown distributions. Among many ...

A graph with two node u,v and an edge(u,v). The optimal is either u or v. By running APPROX-VERTEX-COVER we get u and v. It is always a suboptimal solution. Let A denote the set of edges that were ...