Improved polynomial algorithms for robust bottleneck problems with interval data
Year of publication: |
2010
|
---|---|
Authors: | Volgenant, Anton ; Duin, Cees W. |
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. 37.2010, 5, p. 909-915
|
Subject: | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Theorie | Theory | Engpass | Bottleneck | Rundreiseproblem | Travelling salesman problem |
-
The asymmetric bottleneck traveling salesman problem : algorithms, complexity and empirical analysis
LaRusic, John, (2014)
-
Tool path optimisation method for large thin-wall part of spacecraft
Wang, Haichao, (2018)
-
Transgenetic algorithm for the travelling purchaser problem
Goldbarg, M. C., (2009)
- More ...
-
On a pair of job-machine assignment problems with two stages
Volgenant, Anton, (2010)
-
On weighting two criteria with a parameter in combinatorial optimization problems
Duin, Cees W., (2012)
-
Minmax Steiner biconnected subgraphs and Steiner bipartition of biconnected graphs
Volgenant, Anton, (1995)
- More ...