AAAAAA

   
Results: 1-15 |
Results: 15
MATHEMATICS OF INDUSTRIAL SYSTEMS III - PREFACE
Authors: BURKARD RE IBARAKI T PULLEYBLANK WR
Citation: Re. Burkard et al., MATHEMATICS OF INDUSTRIAL SYSTEMS III - PREFACE, Annals of operations research, 76, 1998, pp. 13-13
WELL-SOLVABLE SPECIAL CASES OF THE TRAVELING SALESMAN PROBLEM - A SURVEY
Authors: BURKARD RE DEINEKO VG VANDAL R VANDERVEEN JAA WOEGINGER GJ
Citation: Re. Burkard et al., WELL-SOLVABLE SPECIAL CASES OF THE TRAVELING SALESMAN PROBLEM - A SURVEY, SIAM review (Print), 40(3), 1998, pp. 496-546
THE QUADRATIC ASSIGNMENT PROBLEM WITH A MONOTONE ANTI-MONGE AND A SYMMETRICAL TOEPLITZ MATRIX - EASY AND HARD CASES
Authors: BURKARD RE CELA E ROTE G WOEGINGER GJ
Citation: Re. Burkard et al., THE QUADRATIC ASSIGNMENT PROBLEM WITH A MONOTONE ANTI-MONGE AND A SYMMETRICAL TOEPLITZ MATRIX - EASY AND HARD CASES, Mathematical programming, 82(1-2), 1998, pp. 125-158
ON THE TRAVELING SALESMAN PROBLEM WITH A RELAXED MONGE MATRIX
Authors: BURKARD RE DEINEKO VG
Citation: Re. Burkard et Vg. Deineko, ON THE TRAVELING SALESMAN PROBLEM WITH A RELAXED MONGE MATRIX, Information processing letters, 67(5), 1998, pp. 231-237
A LINEAR COMPOUND ALGORITHM FOR UNIFORM MACHINE SCHEDULING
Authors: BURKARD RE HE Y KELLERER H
Citation: Re. Burkard et al., A LINEAR COMPOUND ALGORITHM FOR UNIFORM MACHINE SCHEDULING, Computing, 61(1), 1998, pp. 1-9
A LINEAR ALGORITHM FOR THE POS NEG-WEIGHTED 1-MEDIAN PROBLEM ON A CACTUS/
Authors: BURKARD RE KRARUP J
Citation: Re. Burkard et J. Krarup, A LINEAR ALGORITHM FOR THE POS NEG-WEIGHTED 1-MEDIAN PROBLEM ON A CACTUS/, Computing, 60(3), 1998, pp. 193-215
EFFICIENTLY SOLVABLE SPECIAL CASES OF HARD COMBINATORIAL OPTIMIZATIONPROBLEMS
Authors: BURKARD RE
Citation: Re. Burkard, EFFICIENTLY SOLVABLE SPECIAL CASES OF HARD COMBINATORIAL OPTIMIZATIONPROBLEMS, Mathematical programming, 79(1-3), 1997, pp. 55-69
PERSPECTIVES OF MONGE PROPERTIES IN OPTIMIZATION
Authors: BURKARD RE KLINZ B RUDOLF R
Citation: Re. Burkard et al., PERSPECTIVES OF MONGE PROPERTIES IN OPTIMIZATION, Discrete applied mathematics, 70(2), 1996, pp. 95-161
3-DIMENSIONAL AXIAL ASSIGNMENT PROBLEMS WITH DECOMPOSABLE COST COEFFICIENTS
Authors: BURKARD RE RUDOLF R WOEGINGER GJ
Citation: Re. Burkard et al., 3-DIMENSIONAL AXIAL ASSIGNMENT PROBLEMS WITH DECOMPOSABLE COST COEFFICIENTS, Discrete applied mathematics, 65(1-3), 1996, pp. 123-139
A MINIMAX ASSIGNMENT PROBLEM IN TREE-LIKE COMMUNICATION-NETWORKS
Authors: BURKARD RE CELA E WOEGINGER GJ
Citation: Re. Burkard et al., A MINIMAX ASSIGNMENT PROBLEM IN TREE-LIKE COMMUNICATION-NETWORKS, European journal of operational research, 87(3), 1995, pp. 670-684
HEURISTICS FOR BIQUADRATIC ASSIGNMENT PROBLEMS AND THEIR COMPUTATIONAL COMPARISON
Authors: BURKARD RE CELA E
Citation: Re. Burkard et E. Cela, HEURISTICS FOR BIQUADRATIC ASSIGNMENT PROBLEMS AND THEIR COMPUTATIONAL COMPARISON, European journal of operational research, 83(2), 1995, pp. 283-300
THE INVERSE-PARAMETRIC KNAPSACK-PROBLEM
Authors: BURKARD RE PFERSCHY U
Citation: Re. Burkard et U. Pferschy, THE INVERSE-PARAMETRIC KNAPSACK-PROBLEM, European journal of operational research, 83(2), 1995, pp. 376-393
ON THE ROLE OF BOTTLENECK MONGE MATRICES IN COMBINATORIAL OPTIMIZATION
Authors: BURKARD RE
Citation: Re. Burkard, ON THE ROLE OF BOTTLENECK MONGE MATRICES IN COMBINATORIAL OPTIMIZATION, Operations research letters, 17(2), 1995, pp. 53-56
POLYNOMIALLY SOLVABLE CASES OF THE TRAVELING SALESMAN PROBLEM AND A NEW EXPONENTIAL NEIGHBORHOOD
Authors: BURKARD RE DEINEKO VG
Citation: Re. Burkard et Vg. Deineko, POLYNOMIALLY SOLVABLE CASES OF THE TRAVELING SALESMAN PROBLEM AND A NEW EXPONENTIAL NEIGHBORHOOD, Computing, 54(3), 1995, pp. 191-211
CONSTRAINED PARTITIONING PROBLEMS (VOL 28, PG 21, 1990)
Authors: BURKARD RE YAO EY
Citation: Re. Burkard et Ey. Yao, CONSTRAINED PARTITIONING PROBLEMS (VOL 28, PG 21, 1990), Discrete applied mathematics, 46(2), 1993, pp. 185-185
Risultati: 1-15 |