Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-4
|
Results: 4
Bottleneck capacity expansion problems with general budget constraints
Authors:
Burkard, RE Klinz, B Zhang, JZ
Citation:
Re. Burkard et al., Bottleneck capacity expansion problems with general budget constraints, RAIRO RE OP, 35(1), 2001, pp. 1-20
The Steiner tree problem in Kalmanson matrices and in circulant matrices
Authors:
Klinz, B Woeginger, GJ
Citation:
B. Klinz et Gj. Woeginger, The Steiner tree problem in Kalmanson matrices and in circulant matrices, J COMB OPTI, 3(1), 1999, pp. 51-58
A note on the bottleneck graph partition problem
Authors:
Klinz, B Woeginger, GJ
Citation:
B. Klinz et Gj. Woeginger, A note on the bottleneck graph partition problem, NETWORKS, 33(3), 1999, pp. 189-191
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
Authors:
Burkard, RE Feldbacher, K Klinz, B Woeginger, GJ
Citation:
Re. Burkard et al., Minimum-cost strong network orientation problems: Classification, complexity, and algorithms, NETWORKS, 33(1), 1999, pp. 57-70
Risultati:
1-4
|