AAAAAA

   
Results: 1-13 |
Results: 13
Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks
Authors: Burkard, RE Dollani, H Thach, PT
Citation: Re. Burkard et al., Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks, J GLOB OPT, 19(2), 2001, pp. 121-139
The obnoxious center problem on a tree
Authors: Burkard, RE Dollani, H Lin, YX Rote, G
Citation: Re. Burkard et al., The obnoxious center problem on a tree, SIAM J DISC, 14(4), 2001, pp. 498-509
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
Robust location problems with Pos/Neg weights on a tree
Authors: Burkard, RE Dollani, H
Citation: Re. Burkard et H. Dollani, Robust location problems with Pos/Neg weights on a tree, NETWORKS, 38(2), 2001, pp. 102-113
2-medians in trees with pos/neg weights
Authors: Burkard, RE Cela, E Dollani, H
Citation: Re. Burkard et al., 2-medians in trees with pos/neg weights, DISCR APP M, 105(1-3), 2000, pp. 51-71
Mathematics of Industrial Systems IV - Preface
Authors: Santibanez-Gonzalez, E Burkard, RE Ibaraki, T Pulleyblank, WR
Citation: E. Santibanez-gonzalez et al., Mathematics of Industrial Systems IV - Preface, ANN OPER R, 96, 2000, pp. NIL_15-NIL_15
The travelling salesman problem on permuted Monge matrices
Authors: Burkard, RE Deineko, VG Woeginger, GJ
Citation: Re. Burkard et al., The travelling salesman problem on permuted Monge matrices, J COMB OPTI, 2(4), 1999, pp. 333-350
The travelling salesman and the PQ-tree (vol 23, pg 613, 1998)
Authors: Burkard, RE Deineko, VG Woeginger, GJ
Citation: Re. Burkard et al., The travelling salesman and the PQ-tree (vol 23, pg 613, 1998), MATH OPER R, 24(1), 1999, pp. 262-272
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
Volume maximization and orthoconvex approximation of orthogons
Authors: Burkard, RE Miatselski, MM
Citation: Re. Burkard et Mm. Miatselski, Volume maximization and orthoconvex approximation of orthogons, COMPUTING, 63(4), 1999, pp. 317-330
Combinatorial optimization - Editorial
Authors: Burkard, RE
Citation: Re. Burkard, Combinatorial optimization - Editorial, COMPUTING, 63(4), 1999, pp. V-V
The travelling salesman and the PQ-tree
Authors: Burkard, RE Deineko, VG Woeginger, GJ
Citation: Re. Burkard et al., The travelling salesman and the PQ-tree, MATH OPER R, 23(3), 1998, pp. 613-623
A note on MULTIFIT scheduling for uniform machines
Authors: Burkard, RE He, Y
Citation: Re. Burkard et Y. He, A note on MULTIFIT scheduling for uniform machines, COMPUTING, 61(3), 1998, pp. 277-283
Risultati: 1-13 |