Traffic Engineering (TE) enables management of traffic in a manner that optimizes utilization
of network resources in an efficient and balanced manner. However, existing TE solutions …

Mixed-integer linear programming (MILP) has become a cornerstone of operations research.
This is driven by the enhanced efficiency of modern solvers, which can today find globally …

We address the robust vehicle routing problem with time windows (RVRPTW) under
customer demand and travel time uncertainties. As presented thus far in the literature, robust …

The convergence of a column generation algorithm can be improved in practice by using
stabilization techniques. Smoothing and proximal methods based on penalizing the …

The vehicle routing problem with time windows and multiple deliverymen (VRPTWMD) is a
variant of the vehicle routing problem with time windows in which service times at customers …

We develop a multi-level decision making approach for optimal condition-based
maintenance planning of a railway network divided into a large number of sections with …

Satellite scheduling is concerned with the assignment of start and finish times for tasks while
considering the mission objective, available resources, and constraints. This scheduling …

We propose a cutting-plane approach (namely, Benders decomposition) for a class of
capacitated multi-period facility location problems. The novelty of this approach lies on the …

In this paper, we propose an exact branch-price-and-cut (BPC) algorithm for the two-echelon
vehicle routing problem with time windows. This problem arises in city logistics when high …

We present algorithmic innovations for the dual decomposition method to address two-stage
stochastic programs with mixed-integer recourse and provide an open-source software …