default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDimitri P. Bertsekas
Person information
- affiliation: MIT, Cambridge, USA
- award (2018): John von Neumann Theory Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j92]Sushmita Bhattacharya
, Siva Kailas, Sahil Badyal, Stephanie Gil, Dimitri P. Bertsekas:
Multiagent Reinforcement Learning: Rollout and Policy Iteration for POMDP With Application to Multirobot Problems. IEEE Trans. Robotics 40: 2003-2023 (2024)- [c22]Jamison W. Weber, Dhanush R. Giriyan, Devendra R. Parkar, Dimitri P. Bertsekas, Andréa W. Richa:
Distributed Online Rollout for Multivehicle Routing in Unmapped Environments. AAMAS 2024: 1910-1918 - [c21]Daniel Garces, Sushmita Bhattacharya, Dimitri P. Bertsekas, Stephanie Gil:
Approximate Multiagent Reinforcement Learning for On-Demand Urban Mobility Problem on a Large Map. ICRA 2024: 6843-6849 - [i28]Yuchao Li, Dimitri P. Bertsekas:
Most Likely Sequence Generation for n-Grams, Transformers, HMMs, and Markov Chains, by Using Rollout Algorithms. CoRR abs/2403.15465 (2024) - [i27]Pratyusha Musunuru, Yuchao Li, Jamison Weber, Dimitri P. Bertsekas:
An Approximate Dynamic Programming Framework for Occlusion-Robust Multi-Object Tracking. CoRR abs/2405.15137 (2024) - [i26]Dimitri P. Bertsekas:
Model Predictive Control and Reinforcement Learning: A Unified Framework Based on Dynamic Programming. CoRR abs/2406.00592 (2024) - [i25]Atharva Gundawar, Yuchao Li, Dimitri P. Bertsekas:
Superior Computer Chess with Model Predictive Control, Reinforcement Learning, and Rollout. CoRR abs/2409.06477 (2024) - 2023
- [j91]Garima Agrawal, Dimitri P. Bertsekas, Huan Liu:
Auction-Based Learning for Question Answering over Knowledge Graphs. Inf. 14(6): 336 (2023) - [c20]Siddhant Bhambri, Amrita Bhattacharjee, Dimitri P. Bertsekas:
Playing Wordle Using an Online Rollout Algorithm for Deterministic POMDPs. CoG 2023: 1-4 - [c19]Daniel Garces, Sushmita Bhattacharya, Stephanie Gil, Dimitri P. Bertsekas:
Multiagent Reinforcement Learning for Autonomous Routing and Pickup Problem with Adaptation to Variable Demand. ICRA 2023: 3524-3531 - [i24]Jamison W. Weber, Dhanush R. Giriyan, Devendra R. Parkar, Andréa W. Richa, Dimitri P. Bertsekas:
Distributed Online Rollout for Multivehicle Routing in Unmapped Environments. CoRR abs/2305.15596 (2023) - [i23]Dimitri P. Bertsekas:
New Auction Algorithms for the Assignment Problem and Extensions. CoRR abs/2310.03159 (2023) - [i22]Daniel Garces, Sushmita Bhattacharya, Dimitri P. Bertsekas, Stephanie Gil:
Approximate Multiagent Reinforcement Learning for On-Demand Urban Mobility Problem on a Large Map (extended version). CoRR abs/2311.01534 (2023) - 2022
- [j90]Menghan Liu, Erik Poppleton, Giulia Pedrielli, Petr Sulc, Dimitri P. Bertsekas:
ExpertRNA: A New Framework for RNA Secondary Structure Prediction. INFORMS J. Comput. 34(5): 2464-2484 (2022) - [i21]Dimitri P. Bertsekas:
New Auction Algorithms for Path Planning, Network Transport, and Reinforcement Learning. CoRR abs/2207.09588 (2022) - [i20]Siddhant Bhambri, Amrita Bhattacharjee, Dimitri P. Bertsekas:
Reinforcement Learning Methods for Wordle: A POMDP/Adaptive Control Approach. CoRR abs/2211.10298 (2022) - [i19]Daniel Garces, Sushmita Bhattacharya, Stephanie Gil, Dimitri P. Bertsekas:
Multiagent Reinforcement Learning for Autonomous Routing and Pickup Problem with Adaptation to Variable Demand. CoRR abs/2211.14983 (2022) - [i18]Dimitri P. Bertsekas:
Rollout Algorithms and Approximate Dynamic Programming for Bayesian Optimization and Sequential Estimation. CoRR abs/2212.07998 (2022) - 2021
- [j89]Dimitri P. Bertsekas:
Multiagent Reinforcement Learning: Rollout and Policy Iteration. IEEE CAA J. Autom. Sinica 8(2): 249-272 (2021) - [c18]Yuchao Li, Karl Henrik Johansson, Jonas Mårtensson, Dimitri P. Bertsekas:
Data-driven Rollout for Deterministic Optimal Control. CDC 2021: 2169-2176 - [i17]Dimitri P. Bertsekas:
On-Line Policy Iteration for Infinite Horizon Dynamic Programming. CoRR abs/2106.00746 (2021) - [i16]Dimitri P. Bertsekas:
Distributed Asynchronous Policy Iteration for Sequential Zero-Sum Games and Minimax Control. CoRR abs/2107.10406 (2021) - 2020
- [j88]Sushmita Bhattacharya, Sahil Badyal, Thomas Wheeler, Stephanie Gil, Dimitri P. Bertsekas:
Reinforcement Learning for POMDP: Partitioned Rollout and Policy Iteration With Application to Autonomous Sequential Repair Problems. IEEE Robotics Autom. Lett. 5(3): 3967-3974 (2020) - [c17]Sushmita Bhattacharya, Siva Kailas, Sahil Badyal, Stephanie Gil, Dimitri P. Bertsekas:
Multiagent Rollout and Policy Iteration for POMDP with Application to Multi-Robot Repair Problems. CoRL 2020: 1814-1828 - [i15]Sushmita Bhattacharya, Sahil Badyal, Thomas Wheeler, Stephanie Gil, Dimitri P. Bertsekas:
Reinforcement Learning for POMDP: Partitioned Rollout and Policy Iteration with Application to Autonomous Sequential Repair Problems. CoRR abs/2002.04175 (2020) - [i14]Dimitri P. Bertsekas:
Constrained Multiagent Rollout and Multidimensional Assignment with the Auction Algorithm. CoRR abs/2002.07407 (2020) - [i13]Dimitri P. Bertsekas:
Multiagent Value Iteration Algorithms in Dynamic Programming and Reinforcement Learning. CoRR abs/2005.01627 (2020) - [i12]Sushmita Bhattacharya, Siva Kailas, Sahil Badyal, Stephanie Gil, Dimitri P. Bertsekas:
Multiagent Rollout and Policy Iteration for POMDP with Application to Multi-Robot Repair Problems. CoRR abs/2011.04222 (2020)
2010 – 2019
- 2019
- [j87]Dimitri P. Bertsekas:
Feature-based aggregation and deep reinforcement learning: a survey and some new implementations. IEEE CAA J. Autom. Sinica 6(1): 1-31 (2019) - [j86]Dimitri P. Bertsekas:
Affine Monotonic and Risk-Sensitive Models in Dynamic Programming. IEEE Trans. Autom. Control. 64(8): 3117-3128 (2019) - [i11]Dimitri P. Bertsekas:
Multiagent Rollout Algorithms and Reinforcement Learning. CoRR abs/1910.00120 (2019) - [i10]Dimitri P. Bertsekas:
Biased Aggregation, Rollout, and Enhanced Policy Improvement for Reinforcement Learning. CoRR abs/1910.02426 (2019) - 2018
- [j85]Dimitri P. Bertsekas:
Proximal algorithms and temporal difference methods for solving fixed point problems. Comput. Optim. Appl. 70(3): 709-736 (2018) - [j84]Dimitri P. Bertsekas:
Stable Optimal Control and Semicontractive Dynamic Programming. SIAM J. Control. Optim. 56(1): 231-252 (2018) - [j83]Dimitri P. Bertsekas:
Proper Policies in Infinite-State Stochastic Shortest Path Problems. IEEE Trans. Autom. Control. 63(11): 3787-3792 (2018) - [i9]Dimitri P. Bertsekas:
Feature-Based Aggregation and Deep Reinforcement Learning: A Survey and Some New Implementations. CoRR abs/1804.04577 (2018) - 2017
- [j82]Dimitri P. Bertsekas:
Regular Policies in Abstract Dynamic Programming. SIAM J. Optim. 27(3): 1694-1727 (2017) - [j81]Dimitri P. Bertsekas:
Value and Policy Iterations in Optimal Control and Adaptive Dynamic Programming. IEEE Trans. Neural Networks Learn. Syst. 28(3): 500-509 (2017) - 2016
- [j80]Mengdi Wang, Dimitri P. Bertsekas:
Stochastic First-Order Methods with Random Constraint Projection. SIAM J. Optim. 26(1): 681-717 (2016) - [i8]Dimitri P. Bertsekas:
Robust Shortest Path Planning and Semicontractive Dynamic Programming. CoRR abs/1608.01670 (2016) - [i7]Dimitri P. Bertsekas:
Proximal Algorithms and Temporal Differences for Large Linear Systems: Extrapolation, Approximation, and Simulation. CoRR abs/1610.05427 (2016) - 2015
- [j79]Huizhen Yu, Dimitri P. Bertsekas:
A Mixed Value and Policy Iteration Method for Stochastic Control with Universally Measurable Policies. Math. Oper. Res. 40(4): 926-968 (2015) - [j78]Mengdi Wang, Dimitri P. Bertsekas:
Incremental constraint projection methods for variational inequalities. Math. Program. 150(2): 321-363 (2015) - [i6]Dimitri P. Bertsekas:
Centralized and Distributed Newton Methods for Network Optimization and Extensions. CoRR abs/1507.00702 (2015) - [i5]Dimitri P. Bertsekas:
Value and Policy Iteration in Optimal Control and Adaptive Dynamic Programming. CoRR abs/1507.01026 (2015) - [i4]Dimitri P. Bertsekas:
Lambda-Policy Iteration: A Review and a New Implementation. CoRR abs/1507.01029 (2015) - [i3]Dimitri P. Bertsekas:
Incremental Gradient, Subgradient, and Proximal Methods for Convex Optimization: A Survey. CoRR abs/1507.01030 (2015) - [i2]Dimitri P. Bertsekas:
Incremental Aggregated Proximal and Augmented Lagrangian Algorithms. CoRR abs/1509.09257 (2015) - 2014
- [j77]Mengdi Wang, Dimitri P. Bertsekas:
Stabilization of Stochastic Iterative Methods for Singular and Nearly Singular Linear Systems. Math. Oper. Res. 39(1): 1-30 (2014) - 2013
- [j76]Huizhen Yu, Dimitri P. Bertsekas:
Q-learning and policy iteration algorithms for stochastic shortest path problems. Ann. Oper. Res. 208(1): 95-132 (2013) - [j75]Huizhen Yu, Dimitri P. Bertsekas:
On Boundedness of Q-Learning Iterates for Stochastic Shortest Path Problems. Math. Oper. Res. 38(2): 209-227 (2013) - 2012
- [j74]Dimitri P. Bertsekas, Huizhen Yu:
Q-Learning and Enhanced Policy Iteration in Discounted Dynamic Programming. Math. Oper. Res. 37(1): 66-94 (2012) - [i1]Huizhen Yu, Dimitri P. Bertsekas:
Discretized Approximations for POMDP with Average Cost. CoRR abs/1207.4154 (2012) - 2011
- [j73]Dimitri P. Bertsekas, Zhi-Quan Luo:
Preface. Math. Program. 129(2): 159-162 (2011) - [j72]Dimitri P. Bertsekas:
Incremental proximal methods for large scale convex optimization. Math. Program. 129(2): 163-195 (2011) - [j71]Dimitri P. Bertsekas, Huizhen Yu:
A Unifying Polyhedral Approximation Framework for Convex Optimization. SIAM J. Optim. 21(1): 333-360 (2011) - [j70]Dimitri P. Bertsekas:
Temporal Difference Methods for General Projected Equations. IEEE Trans. Autom. Control. 56(9): 2128-2139 (2011) - 2010
- [j69]Huizhen Yu, Dimitri P. Bertsekas:
Error Bounds for Approximations from Projected Linear Equations. Math. Oper. Res. 35(2): 306-329 (2010) - [j68]Angelia Nedic, Dimitri P. Bertsekas:
The effect of deterministic noise in subgradient methods. Math. Program. 125(1): 75-99 (2010) - [c16]Dimitri P. Bertsekas, Huizhen Yu:
Distributed asynchronous policy iteration in dynamic programming. Allerton 2010: 1368-1375 - [c15]Dimitri P. Bertsekas, Huizhen Yu:
Q-learning and enhanced policy iteration in discounted dynamic programming. CDC 2010: 1409-1416 - [c14]Dimitri P. Bertsekas:
Pathologies of temporal difference methods in approximate dynamic programming. CDC 2010: 3034-3039
2000 – 2009
- 2009
- [j67]Huizhen Yu, Dimitri P. Bertsekas:
Convergence Results for Some Temporal Difference Methods Based on Least Squares. IEEE Trans. Autom. Control. 54(7): 1515-1531 (2009) - [c13]Dimitri P. Bertsekas:
A unified framework for temporal difference methods. ADPRL 2009: 1-7 - [c12]Huizhen Yu, Dimitri P. Bertsekas:
Basis function adaptation methods for cost approximation in MDP. ADPRL 2009: 74-81 - [r2]Dimitri P. Bertsekas:
Auction Algorithms. Encyclopedia of Optimization 2009: 128-132 - [r1]Dimitri P. Bertsekas:
Neuro-Dynamic Programming. Encyclopedia of Optimization 2009: 2555-2560 - 2008
- [j66]Huizhen Yu, Dimitri P. Bertsekas:
On Near Optimality of the Set of Finite-State Controllers for Average Cost POMDP. Math. Oper. Res. 33(1): 1-11 (2008) - [c11]Huizhen Yu, Dimitri P. Bertsekas:
New error bounds for approximations from projected linear equations. Allerton 2008: 1116-1123 - [c10]Huizhen Yu, Dimitri P. Bertsekas:
New Error Bounds for Approximations from Projected Linear Equations. EWRL 2008: 253-267 - 2007
- [j65]Dimitri P. Bertsekas, Paul Tseng:
Set Intersection Theorems and Existence of Optimal Solutions. Math. Program. 110(2): 287-314 (2007) - [j64]Dimitri P. Bertsekas:
Separable Dynamic Programming and Approximate Decomposition Methods. IEEE Trans. Autom. Control. 52(5): 911-916 (2007) - [j63]Dimitri P. Bertsekas, John N. Tsitsiklis:
Comments on "Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules". IEEE Trans. Autom. Control. 52(5): 968-969 (2007) - [j62]Dimitri P. Bertsekas, John N. Tsitsiklis:
Erratum to "Comments on 'Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules'". IEEE Trans. Autom. Control. 52(7): 1356 (2007) - 2006
- [j61]Dimitri P. Bertsekas, Asuman E. Ozdaglar, Paul Tseng:
Enhanced Fritz John Conditions for Convex Programming. SIAM J. Optim. 16(3): 766-797 (2006) - [c9]Dimitri P. Bertsekas:
Neuro-Dynamic Programming: An Overview and Recent Results. OR 2006: 71-72 - 2005
- [b6]Dimitri P. Bertsekas:
Dynamic programming and optimal control, 3rd Edition. Athena Scientific 2005, ISBN 1886529264, pp. I-XV, 1-543 - [j60]Dimitri P. Bertsekas:
Dynamic Programming and Suboptimal Control: A Survey from ADP to MPC. Eur. J. Control 11(4-5): 310-334 (2005) - [c8]Dimitri P. Bertsekas:
Dynamic Programming and Suboptimal Control: From ADP to MPC. CDC/ECC 2005: 10 - 2004
- [j59]Asuman E. Ozdaglar, Dimitri P. Bertsekas:
The relation between pseudonormality and quasiregularity in constrained optimization. Optim. Methods Softw. 19(5): 493-506 (2004) - [c7]Huizhen Yu, Dimitri P. Bertsekas:
Discretized Approximations for POMDP with Average Cost. UAI 2004: 519 - 2003
- [j58]Angelia Nedic, Dimitri P. Bertsekas:
Least Squares Policy Evaluation Algorithms with Linear Function Approximation. Discret. Event Dyn. Syst. 13(1-2): 79-110 (2003) - [j57]Asuman E. Ozdaglar, Dimitri P. Bertsekas:
Routing and wavelength assignment in optical networks. IEEE/ACM Trans. Netw. 11(2): 259-272 (2003) - 2002
- [j56]Jinane Abounadi, Dimitri P. Bertsekas, Vivek S. Borkar:
Stochastic Approximation for Nonexpansive Maps: Application to Q-Learning Algorithms. SIAM J. Control. Optim. 41(1): 1-22 (2002) - 2001
- [j55]Jinane Abounadi, Dimitri P. Bertsekas, Vivek S. Borkar:
Learning Algorithms for Markov Decision Processes with Average Cost. SIAM J. Control. Optim. 40(3): 681-698 (2001) - [j54]Angelia Nedic, Dimitri P. Bertsekas:
Incremental Subgradient Methods for Nondifferentiable Optimization. SIAM J. Optim. 12(1): 109-138 (2001) - [j53]Cynara Wu, Dimitri P. Bertsekas:
Distributed power control algorithms for wireless networks. IEEE Trans. Veh. Technol. 50(2): 504-514 (2001) - [c6]Chi-Hsiang Yeh, Emmanouel A. Varvarigos, Dimitri P. Bertsekas, Hussein T. Mouftah:
Reservation-Based Session Routing for Broadband Communication Networks with Strict QoS Requirements. ICOIN 2001: 593-602 - 2000
- [j52]Paul Tseng, Dimitri P. Bertsekas:
An ε-relaxation method for separable convex cost generalized network flow problems. Math. Program. 88(1): 85-104 (2000) - [j51]Dimitri P. Bertsekas, John N. Tsitsiklis:
Gradient Convergence in Gradient methods with Errors. SIAM J. Optim. 10(3): 627-642 (2000) - [j50]Dimitri P. Bertsekas, M. L. Homer, D. A. Logan, Stephen D. Patek, Nils R. Sandell:
Missile defense and interceptor allocation by neuro-dynamic programming. IEEE Trans. Syst. Man Cybern. Part A 30(1): 42-51 (2000)
1990 – 1999
- 1999
- [j49]Dimitri P. Bertsekas:
A Note on Error Bounds for Convex and Nonconvex Programs. Comput. Optim. Appl. 12(1-3): 41-51 (1999) - [j48]Dimitri P. Bertsekas, David A. Castañón:
Rollout Algorithms for Stochastic Scheduling Problems. J. Heuristics 5(1): 89-108 (1999) - 1998
- [j47]Lazaros C. Polymenakos, Dimitri P. Bertsekas, John N. Tsitsiklis:
Implementation of efficient algorithms for globally optimal trajectories. IEEE Trans. Autom. Control. 43(2): 278-283 (1998) - 1997
- [j46]Dimitri P. Bertsekas, John N. Tsitsiklis, Cynara Wu:
Rollout Algorithms for Combinatorial Optimization. J. Heuristics 3(3): 245-262 (1997) - [j45]Dimitri P. Bertsekas, Lazaros C. Polymenakos, Paul Tseng:
An ε-Relaxation Method for Separable Convex Cost Network Flow Problems. SIAM J. Optim. 7(3): 853-870 (1997) - [j44]Dimitri P. Bertsekas:
A New Class of Incremental Gradient Methods for Least Squares Problems. SIAM J. Optim. 7(4): 913-926 (1997) - 1996
- [b5]Dimitri P. Bertsekas, John N. Tsitsiklis:
Neuro-dynamic programming. Optimization and neural computation series 3, Athena Scientific 1996, ISBN 1886529108, pp. I-XIII, 1-491 - [j43]Serap A. Savari, Dimitri P. Bertsekas:
Finite Termination of Asynchronous Iterative Algorithms. Parallel Comput. 22(1): 39-56 (1996) - [j42]Dimitri P. Bertsekas:
Incremental Least Squares Methods and the Extended Kalman Filter. SIAM J. Optim. 6(3): 807-822 (1996) - [j41]Emmanouel A. Varvarigos, Dimitri P. Bertsekas:
A Conflict Sense Routing Protocol and Its Performance for Hypercubes. IEEE Trans. Computers 45(6): 693-703 (1996) - [c5]Paul Tseng, Dimitri P. Bertsekas:
A epsilon-Relaxation Method for Generalized Separable Convex Cost Network Flow Problems. IPCO 1996: 85-93 - [c4]Satinder Singh, Dimitri P. Bertsekas:
Reinforcement Learning for Dynamic Channel Allocation in Cellular Telephone Systems. NIPS 1996: 974-980 - 1995
- [j40]Dimitri P. Bertsekas, Stefano Pallottino, Maria Grazia Scutellà:
Polynomial auction algorithms for shortest paths. Comput. Optim. Appl. 4(2): 99-125 (1995) - [j39]Dimitri P. Bertsekas:
A Counterexample to Temporal Differences Learning. Neural Comput. 7(2): 270-279 (1995) - [j38]Dimitri P. Bertsekas:
Generic rank-one corrections for value iteration in Markovian decision problems. Oper. Res. Lett. 17(3): 111-119 (1995) - [j37]Emmanouel A. Varvarigos, Dimitri P. Bertsekas:
Transposition of Banded Matrices in Hypercubes: A Nearly Isotropic Task. Parallel Comput. 21(2): 243-264 (1995) - [j36]Emmanouel A. Varvarigos, Dimitri P. Bertsekas:
Dynamic Broadcasting in Parallel Computing. IEEE Trans. Parallel Distributed Syst. 6(2): 120-131 (1995) - 1994
- [j35]Emmanouel A. Varvarigos, Dimitri P. Bertsekas:
Partial Multinode Broadcast and Partial Exchange Algorithms for d-Dimensional Meshes. J. Parallel Distributed Comput. 23(2): 177-189 (1994) - [j34]Lazaros Polymenakos, Dimitri P. Bertsekas:
Parallel Shortest Path Auction Algorithms. Parallel Comput. 20(9): 1221-1247 (1994) - [j33]Dimitri P. Bertsekas, Paul Tseng:
Partial Proximal Minimization Algorithms for Convex Pprogramming. SIAM J. Optim. 4(3): 551-572 (1994) - [j32]Emmanouel A. Varvarigos, Dimitri P. Bertsekas:
Performance of hypercube routing schemes with or without buffering. IEEE/ACM Trans. Netw. 2(3): 299-311 (1994) - 1993
- [j31]Dimitri P. Bertsekas, David A. Castañón:
A generic auction algorithm for the minimum cost network flow problem. Comput. Optim. Appl. 2(3): 229-259 (1993) - [j30]Dimitri P. Bertsekas, David A. Castañón:
Parallel primal-dual methods for the minimum cost flow problem. Comput. Optim. Appl. 2(4): 317-336 (1993) - [j29]Dimitri P. Bertsekas, David A. Castañón:
Parallel Asynchronous Hungarian Methods for the Assignment Problem. INFORMS J. Comput. 5(3): 261-274 (1993) - [j28]Paul Tseng, Dimitri P. Bertsekas:
On the convergence of the exponential multiplier method for convex programming. Math. Program. 60: 1-19 (1993) - [j27]Dimitri P. Bertsekas:
A simple and fast label correcting algorithm for shortest paths. Networks 23(8): 703-709 (1993) - [j26]Dimitri P. Bertsekas, David A. Castañón, Haralampos Tsaknakis:
Reverse Auction and the Solution of Inequality Constrained Assignment Problems. SIAM J. Optim. 3(2): 268-297 (1993) - [j25]Emmanouel A. Varvarigos, Dimitri P. Bertsekas:
Multinode Broadcast in Hypercubes and Rings with Randomly Distributed Length of Packets. IEEE Trans. Parallel Distributed Syst. 4(2): 144-154 (1993) - 1992
- [b4]Dimitri P. Bertsekas, Robert G. Gallager:
Data Networks, Second Edition. Prentice Hall 1992, ISBN 978-0-13-201674-2, pp. I-XIX, 1-556 - [j24]Dimitri P. Bertsekas:
Auction algorithms for network flow problems: A tutorial introduction. Comput. Optim. Appl. 1(1): 7-66 (1992) - [j23]Dimitri P. Bertsekas, David A. Castañón:
A forward/reverse auction algorithm for asymmetric assignment problems. Comput. Optim. Appl. 1(3): 277-297 (1992) - [j22]Jonathan Eckstein, Dimitri P. Bertsekas:
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55: 293-318 (1992) - [j21]Emmanouel A. Varvarigos, Dimitri P. Bertsekas:
Communication algorithms for isotropic tasks in hypercubes and wraparound meshes. Parallel Comput. 18(11): 1233-1257 (1992) - [c3]Emmanouel A. Varvarigos, Dimitri P. Bertsekas:
Partial Multinode Broadcast Algorithms for D-Dimensional Meshes. ICPP (3) 1992: 51-54 - 1991
- [b3]Dimitri P. Bertsekas:
Linear network optimization - algorithms and codes. MIT Press 1991, ISBN 978-0-262-02334-4, pp. I-XI, 1-359 - [j20]Dimitri P. Bertsekas, John N. Tsitsiklis:
Some aspects of parallel and distributed iterative algorithms - A survey, . Autom. 27(1): 3-21 (1991) - [j19]Dimitri P. Bertsekas, C. Özveren, George D. Stamoulis, Paul Tseng, John N. Tsitsiklis:
Optimal Communication Algorithms for Hypercubes. J. Parallel Distributed Comput. 11(4): 263-275 (1991) - [j18]Paul Tseng, Dimitri P. Bertsekas:
Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints. Math. Oper. Res. 16(3): 462-481 (1991) - [j17]Dimitri P. Bertsekas, John N. Tsitsiklis:
An Analysis of Stochastic Shortest Path Problems. Math. Oper. Res. 16(3): 580-595 (1991) - [j16]Dimitri P. Bertsekas, David A. Castañón:
Parallel synchronous and asynchronous implementations of the auction algorithm. Parallel Comput. 17(6-7): 707-732 (1991) - [j15]Dimitri P. Bertsekas:
An Auction Algorithm for Shortest Paths. SIAM J. Optim. 1(4): 425-447 (1991) - 1990
- [j14]Paul Tseng, Dimitri P. Bertsekas:
Relaxation Methods for Monotropic Programs. Math. Program. 46: 127-151 (1990)
1980 – 1989
- 1989
- [b2]Dimitri P. Bertsekas, John N. Tsitsiklis:
Parallel and distributed computation. Prentice Hall 1989, ISBN 978-0-13-648759-3, pp. I-XIX, 1-715 - [c2]Dimitri P. Bertsekas, John N. Tsitsiklis:
Convergence rate and termination of asynchronous iterative algorithms. ICS 1989: 461-470 - 1988
- [j13]Dimitri P. Bertsekas, Paul Tseng:
Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems. Oper. Res. 36(1): 93-114 (1988) - [j12]Dimitri P. Bertsekas, Jonathan Eckstein:
Dual coordinate step methods for linear network flow problems. Math. Program. 42(1-3): 203-243 (1988) - 1987
- [j11]Paul Tseng, Dimitri P. Bertsekas:
Relaxation Methods for Linear Programs. Math. Oper. Res. 12(4): 569-596 (1987) - [j10]Paul Tseng, Dimitri P. Bertsekas:
Relaxation methods for problems with strictly convex separable costs and linear constraints. Math. Program. 38(3): 303-321 (1987) - [j9]Eli Gafni, Dimitri P. Bertsekas:
Asymptotic optimality of shortest path routing algorithms. IEEE Trans. Inf. Theory 33(1): 83-90 (1987) - 1985
- [j8]Dimitri P. Bertsekas:
A unified framework for primal-dual methods in minimum cost network flow problems. Math. Program. 32(2): 125-145 (1985) - 1984
- [j7]Dimitri P. Bertsekas, Eli Gafni, Robert G. Gallager:
Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks. IEEE Trans. Commun. 32(8): 911-919 (1984) - 1983
- [j6]Dimitri P. Bertsekas:
Distributed asynchronous computation of fixed points. Math. Program. 27(1): 107-120 (1983) - [c1]Eliezer M. Gafni, Dimitri P. Bertsekas:
Path assignment for virtual circuit routing. SIGCOMM 1983: 21-25 - 1981
- [j5]Dimitri P. Bertsekas:
A new algorithm for the assignment problem. Math. Program. 21(1): 152-171 (1981) - [j4]Eli Gafni, Dimitri P. Bertsekas:
Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology. IEEE Trans. Commun. 29(1): 11-18 (1981)
1970 – 1979
- 1979
- [j3]Steven E. Shreve, Dimitri P. Bertsekas:
Universally Measurable Policies in Dynamic Programming. Math. Oper. Res. 4(1): 15-30 (1979) - 1976
- [j2]Dimitri P. Bertsekas:
Multiplier methods: A survey. Autom. 12(2): 133-145 (1976) - 1975
- [j1]Dimitri P. Bertsekas:
Necessary and sufficient conditions for a penalty method to be exact. Math. Program. 9(1): 87-99 (1975) - 1971
- [b1]Dimitri P. Bertsekas:
Control of uncertain systems with a set-membership description of the uncertainty. Massachusetts Institute of Technology, USA, 1971
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 00:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
