On the total number of pivots required for certain parametric combinatorial optimization problems
Year of publication: |
1983
|
---|---|
Authors: | Katoh, Naoki ; Ibaraki, Toshihide |
Publisher: |
Kobe |
Subject: | Programming | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Scheduling-Verfahren | Scheduling problem |
-
The elliosoid method and its consequences in combinatorial optimization
Grötschel, M., (1980)
-
Adjacency on polytopes in combinatorial optimization
Hausmann, Dirk, (1980)
-
Industrial scheduling abstracts (1950-1966)
Eilon, Samuel, (1967)
- More ...
-
An efficient algorithm for K shortest simple paths
Katoh, Naoki, (1981)
-
Effects of cautious locking on coping with long transactions
Kiniwa, Jun, (1997)
-
Performance evaluation of cautious transaction schedulers
Kiniwa, Jun, (1993)
- More ...