Improved integer linear programming formulations for the job sequencing and tool switching problem
Year of publication: |
2015
|
---|---|
Authors: | Catanzaro, Daniele ; Gouveia, Luis ; Labbé, Martine |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 244.2015, 3 (1.8.), p. 766-777
|
Subject: | Job sequencing | Tool switching | Traveling salesman problem | Combinatorial optimization | Integer programming | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Ganzzahlige Optimierung | Mathematische Optimierung | Mathematical programming | Rundreiseproblem | Travelling salesman problem | Tourenplanung | Vehicle routing problem |
-
Facets and valid inequalities for the time-dependent travelling salesman problem
Miranda-Bront, Juan José, (2014)
-
Geometric and LP-based heuristics for angular travelling salesman problems in the plane
Staněk, Rostislav, (2019)
-
Identification of unidentified equality constraints for integer programming problems
Moeini, Asghar, (2017)
- More ...
-
Improved integer linear programming formulations for the job Sequencing and tool Switching Problem
Catanzaro, Daniele, (2015)
-
The Balanced Minimum Evolution Problem
Catanzaro, Daniele, (2012)
-
A Class Representative Model for Pure Parsimony Haplotyping
Catanzaro, Daniele, (2010)
- More ...