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: | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Engpass | Bottleneck | Theorie | Theory |
-
Theory of constraints product mix optimisation based on immune algorithm
Wang, J. Q., (2009)
-
Bornstein, Claudio T., (2012)
-
The TOC-based algorithm for solving multiple constraint resources : a re-examination
Wang, Jun-qiang, (2014)
- More ...
-
Minmax Steiner biconnected subgraphs and Steiner bipartition of biconnected graphs
Volgenant, Anton, (1995)
-
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)
- More ...