Lower bounds for large traveling umpire instances : new valid inequalities and a branch-and-cut algorithm
Year of publication: |
August 2016
|
---|---|
Authors: | Oliveira, Lucas de ; Souza, Cid C. de ; Yunes, Tallys |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 72.2016, p. 147-159
|
Subject: | Sports scheduling | Traveling umpire problem | Integer programming | Branch-and-cut | OR in sports | Mathematische Optimierung | Mathematical programming | Tourenplanung | Vehicle routing problem | Ganzzahlige Optimierung | Sport | Sports | USA | United States | Theorie | Theory |
-
Oliveira, Lucas de, (2014)
-
The clustered orienteering problem
Angelelli, E., (2014)
-
An integer programming approach for the time-dependent traveling salesman problem with time windows
Montero, AgustÃn, (2017)
- More ...
-
Oliveira, Lucas de, (2014)
-
de Oliveira, Lucas, (2014)
-
Optimizing the layout of proportional symbol maps : polyhedra and computation
Kunigami, Guilherme, (2014)
- More ...