Discrete Optimization

We address in this paper the two-machine job shop scheduling problem with a single server that sets up the jobs before they get processed on the machines. The server is only needed during the set-up and becomes free at the end of this phase. ...

We develop theoretical foundations and practical algorithms for vehicle routing with time-dependent travel times. We also provide new benchmark instances and experimental results.

First, we study basic operations on piecewise linear arrival time ...

A packing in a graph is a set of vertices that are mutually distance at least 3 apart. By using optimization and linear programming to help analyze the greedy algorithm, we improve on a result of Favaron and show that every connected cubic graph ...