Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
Year of publication: |
2013
|
---|---|
Authors: | Filippi, Carlo ; Stevanato, Elisa |
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. 40.2013, 10, p. 2418-2428
|
Subject: | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Rundreiseproblem | Travelling salesman problem | USA | United States | Theorie | Theory |
-
Heuristics based on spacefilling curves for combinatorial problems in Euclidean space
Bartholdi, John J., (1988)
-
Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
Letchford, Adam N., (2016)
-
Model of megalopolises in the tool path optimisation for CNC plate cutting machines
Čencov, Aleksandr Georgievič, (2018)
- More ...
-
Mixed integer linear programming models for optimal crop selection
Filippi, Carlo, (2017)
-
Filippi, Carlo, (2013)
-
Exact and approximate algorithms for high-multiplicity parallel machine scheduling
Filippi, Carlo, (2009)
- More ...