Jean-François Cordeau

Benders Decomposition for Very Large Scale Partial Set Covering and Maximal Covering Problems

  • Jean-François Cordeau
  • Fabio Furini
  • Ivana Ljubić
    • Categories Branch and Cut Algorithms, Combinatorial Optimization Tags , , , ,

    Covering problems constitute an important family of facility location problems. This paper intro- duces a new exact algorithm for two important members of this family: i) the maximal covering location problem, which requires finding a subset of facilities that maximizes the amount of demand covered while respecting a budget constraint on the cost of the … Read more

    The Delivery Man Problem with Time Windows

  • Jean-François Cordeau
  • Géraldine Heilporn
  • Gilbert Laporte
    • Categories (Mixed) Integer Linear Programming Tags , , , ,

    In this paper, a variant of the Traveling Salesman Problem with Time Windows is considered, which consists in minimizing the sum of travel durations between a depot and several customer locations. Two mixed integer linear programming formulations are presented for this problem: a classical arc flow model and a sequential assignment model. Several polyhedral results … Read more