AAAAAA

   
Results: 1-12 |
Results: 12
GLOBAL PRICE UPDATES HELP
Authors: GOLDBERG AV KENNEDY R
Citation: Av. Goldberg et R. Kennedy, GLOBAL PRICE UPDATES HELP, SIAM journal on discrete mathematics, 10(4), 1997, pp. 551-572
SCALING METHODS FOR FINDING A MAXIMUM FREE MULTIFLOW OF MINIMUM-COST
Authors: GOLDBERG AV KARZANOV AV
Citation: Av. Goldberg et Av. Karzanov, SCALING METHODS FOR FINDING A MAXIMUM FREE MULTIFLOW OF MINIMUM-COST, Mathematics of operations research, 22(1), 1997, pp. 90-109
AN EFFICIENT IMPLEMENTATION OF A SCALING MINIMUM-COST FLOW ALGORITHM
Authors: GOLDBERG AV
Citation: Av. Goldberg, AN EFFICIENT IMPLEMENTATION OF A SCALING MINIMUM-COST FLOW ALGORITHM, Journal of algorithms, 22(1), 1997, pp. 1-29
ON IMPLEMENTING THE PUSH-RELABEL METHOD FOR THE MAXIMUM FLOW PROBLEM
Authors: CHERKASSKY BV GOLDBERG AV
Citation: Bv. Cherkassky et Av. Goldberg, ON IMPLEMENTING THE PUSH-RELABEL METHOD FOR THE MAXIMUM FLOW PROBLEM, Algorithmica, 19(4), 1997, pp. 390-410
STRATEGIC DIRECTIONS IN RESEARCH IN THEORY OF COMPUTING
Authors: LOUI MC CONDON A FICH F FREDERICKSON GN GOLDBERG AV JOHNSON DS MAHANEY S RAGHAVAN P SAVAGE J SELMAN AL SHMOYS DB
Citation: Mc. Loui et al., STRATEGIC DIRECTIONS IN RESEARCH IN THEORY OF COMPUTING, ACM computing surveys, 28(4), 1996, pp. 575-590
SHORTEST PATHS ALGORITHMS - THEORY AND EXPERIMENTAL EVALUATION
Authors: CHERKASSKY BV GOLDBERG AV RADZIK T
Citation: Bv. Cherkassky et al., SHORTEST PATHS ALGORITHMS - THEORY AND EXPERIMENTAL EVALUATION, Mathematical programming, 73(2), 1996, pp. 129-174
SCALING ALGORITHMS FOR THE SHORTEST PATHS PROBLEM
Authors: GOLDBERG AV
Citation: Av. Goldberg, SCALING ALGORITHMS FOR THE SHORTEST PATHS PROBLEM, SIAM journal on computing, 24(3), 1995, pp. 494-504
AN EFFICIENT COST SCALING ALGORITHM FOR THE ASSIGNMENT PROBLEM
Authors: GOLDBERG AV KENNEDY R
Citation: Av. Goldberg et R. Kennedy, AN EFFICIENT COST SCALING ALGORITHM FOR THE ASSIGNMENT PROBLEM, Mathematical programming, 71(2), 1995, pp. 153-177
TIGHT BOUNDS ON THE NUMBER OF MINIMUM-MEAN CYCLE CANCELLATIONS AND RELATED RESULTS
Authors: RADZIK T GOLDBERG AV
Citation: T. Radzik et Av. Goldberg, TIGHT BOUNDS ON THE NUMBER OF MINIMUM-MEAN CYCLE CANCELLATIONS AND RELATED RESULTS, Algorithmica, 11(3), 1994, pp. 226-242
A PARALLEL ALGORITHM FOR RECONFIGURING A MULTIBUTTERFLY NETWORK WITH FAULTY SWITCHES
Authors: GOLDBERG AV MAGGS BM PLOTKIN SA
Citation: Av. Goldberg et al., A PARALLEL ALGORITHM FOR RECONFIGURING A MULTIBUTTERFLY NETWORK WITH FAULTY SWITCHES, I.E.E.E. transactions on computers, 43(3), 1994, pp. 321-326
A HEURISTIC IMPROVEMENT OF THE BELLMAN-FORD ALGORITHM
Authors: GOLDBERG AV RADZIK T
Citation: Av. Goldberg et T. Radzik, A HEURISTIC IMPROVEMENT OF THE BELLMAN-FORD ALGORITHM, Applied mathematics letters, 6(3), 1993, pp. 3-6
APPROXIMATING MATCHINGS IN PARALLEL
Authors: FISCHER T GOLDBERG AV HAGLIN DJ PLOTKIN S
Citation: T. Fischer et al., APPROXIMATING MATCHINGS IN PARALLEL, Information processing letters, 46(3), 1993, pp. 115-118
Risultati: 1-12 |