Bertsekas D.P.

D.P. Bertsekas

Information about the author D.P. Bertsekas will soon be added to the site.
Found 4 papers in total
An ε-relaxation method for separable convex cost generalized network flow problems
An ε-relaxation method for separable convex cost generalized network flow problems
2000
We generalize the ε-relaxation method for the single commodity, linear or...
Stochastic shortest path games
Stochastic shortest path games
1999
We consider dynamic, two-player, zero-sum games where the ‘minimizing’...
Rollout algorithms for stochastic scheduling problems
Rollout algorithms for stochastic scheduling problems
1999
Stochastic scheduling problems are difficult stochastic control problems with...
The auction algorithm: A distributed relaxation method for the assignment problem
The auction algorithm: A distributed relaxation method for the assignment problem
1988
We propose a massively parallelizable algorithm for the classical assignment problem....
Papers per page: