没有合适的资源?快使用搜索试试~ 我知道了~
网络优化:连续和离散模型(英文文字版)【Dimitri P. Bertsekas】
需积分: 46 31 下载量 9 浏览量
2018-10-12
22:52:08
上传
评论
收藏 3.02MB PDF 举报
温馨提示
试读
585页
网络优化:连续和离散模型 英文文字版 Dimitri P. Bertsekas
资源推荐
资源详情
资源评论
Network Optimization:
Continuous and Discrete Models
Dimitri P. Bertsekas
Massachusetts Institute of Technology
WWW site for book information and orders
http://www.athenasc.com
Athena Scientific, Belmont, Massachusetts
Athena Scientific
Post Office Box 391
Belmont, Mass. 02178-9998
U.S.A.
Email: info@athenasc.com
WWW: http://www.athenasc.com
Cover Design: Ann Gallager
c
1998 Dimitri P. Bertsekas
All rights reserved. No part of this book may be reproduced in any form
by any electronic or mechanical means (including photocopying, recording,
or information storage and retrieval) without permission in writing from
the publisher.
Publisher’s Cataloging-in-Publication Data
Bertsekas, Dimitri P.
Network Optimization: Continuous and Discrete Models
Includes bibliographical references and index
1. Network analysis (Planning). 2. Mathematical Optimization. I. Title.
T57.85.B44 1998 658.4’032-dc20 98-70298
ISBN 1-886529-02-7
ABOUT THE AUTHOR
Dimitri Bertsekas studied Mechanical and Electrical Engineering at
the National Technical University of Athens, Greece, and obtained his
Ph.D. in system science from the Massachusetts Institute of Technology.
He has held faculty positions at Stanford University and the Uni-
versity of Illinois. Since 1979 he has been teaching at the Massachusetts
Institute of Technology (M.I.T.), where he is currently McAfee Professor
of Engineering. He consults regularly with private industry and has held
editorial positions in several journals. His research spans several fields,
including optimization, control, large-scale computation, and data commu-
nication networks. He has written many research papers and he is the
author or coauthor of thirteen textbooks and research monographs.
Professor Bertsekas was awarded the INFORMS 1997 Prize for Re-
search Excellence in the Interface Between Operations Research and Com-
puter Science for his book ”Neuro-Dynamic Programming” (co-authored
with John Tsitsiklis), the 2000 Greek National Award for Operations Re-
search, and the 2001 ACC John R. Ragazzini Education Award. In 2001,
he was elected to the United States National Academy of Engineering.
iii
ATHENA SCIENTIFIC
OPTIMIZATION AND COMPUTATION SERIES
1. Convex Analysis and Optimization, by Dimitri P. Bertsekas, with
Angelia Nedi´c and Asuman E. Ozdaglar, 2003, ISBN 1-886529-
45-0, 560 pages
2. Introduction to Probability by Dimitri P. Bertsekas and John
Tsitsiklis, 2002, ISBN 1-886529-40-X, 430 pages
3. Dynamic Programming and Optimal Control, Vols. I and II, 2nd
Edition, by Dimitri P. Bertsekas, 2001, ISBN 1-886529-08-6, 704
pages
4. Nonlinear Programming, 2nd Edition, by Dimitri P. Bertsekas,
1999, ISBN 1-886529-00-0, 800 pages
5. Network Optimization: Continuous and Discrete Models by Dim-
itri P. Bertsekas, 1998, ISBN 1-886529-02-7, 608 pages
6. Network Flows and Monotropic Optimization by R. Tyrrell Rock-
afellar, 1998, ISBN 1-886529-06-X, 634 pages
7. Introduction to Linear Optimization by Dimitris Bertsimas and
John N. Tsitsiklis, 1997, ISBN 1-886529-19-1, 608 pages
8. Parallel and Distributed Computation: Numerical Methods by
Dimitri P. Bertsekas and John N. Tsitsiklis, 1997, ISBN 1-886529-
01-9, 718 pages
9. Neuro-Dynamic Programming, by Dimitri P. Bertsekas and John
N. Tsitsiklis, 1996, ISBN 1-886529-10-8, 512 pages
10. Constrained Optimization and Lagrange Multiplier Methods, by
Dimitri P. Bertsekas, 1996, ISBN 1-886529-04-3, 410 pages
11. Stochastic Optimal Control: The Discrete-Time Case by Dimitri
P. Bertsekas and Steven E. Shreve, 1996, ISBN 1-886529-03-5,
330 pages
iv
Contents
1. Introduction .................... p.1
1.1. Graphs and Flows .................... p.3
1.1.1. Paths and Cycles .................. p.4
1.1.2. Flow and Divergence ................ p.6
1.1.3. Path Flows and Conformal Decomposition ....... p.7
1.2. Network Flow Models – Examples ............. p.8
1.2.1. The Minimum Cost Flow Problem . ......... p.9
1.2.2. Network Flow Problems with Convex Cost .......p.16
1.2.3. Multicommodity Flow Problems . . .........p.17
1.2.4. Discrete Network Optimization Problems .......p.19
1.3. Network Flow Algorithms – An Overview .........p.20
1.3.1. Primal Cost Improvement ..............p.21
1.3.2. Dual Cost Improvement ...............p.24
1.3.3. Auction ......................p.27
1.3.4. Good, Bad, and Polynomial Algorithms ........p.35
1.4. Notes, Sources, and Exercises ...............p.37
2. Shortest Path Problems ...............p.51
2.1. Problem Formulation and Applications . .........p.52
2.2. A Generic Shortest Path Algorithm . . . .........p.57
2.3. Label Setting (Dijkstra) Methods .............p.65
2.3.1. Performance of Label Setting Methods .........p.68
2.3.2. The Binary Heap Method ..............p.69
2.3.3. Dial’s Algorithm ..................p.70
2.4. Label Correcting Methods ................p.73
2.4.1. The Bellman-Ford Method ..............p.73
2.4.2. The D’Esopo-Pape Algorithm . . . .........p.75
2.4.3. The SLF and LLL Algorithms . . . .........p.76
2.4.4. The Threshold Algorithm ..............p.78
2.4.5. Comparison of Label Setting and Label Correcting . . . p. 80
2.5. Single Origin/Single Destination Methods .........p.81
2.5.1. Label Setting ....................p.81
v
剩余584页未读,继续阅读
资源评论
颹蕭蕭
- 粉丝: 5w+
- 资源: 35
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
最新资源
- 基于yolov5识别算法实现的DNF自动脚本源码.zip
- 基于Python实现的自动化办公项目.zip
- 基于python实现的基于PyQt5和爬虫的小说阅读系统.zip
- 机械设计整经机上纱自动化sw20非常好的设计图纸100%好用.zip
- Screenshot_20240427_031602.jpg
- 网页PDF_2024年04月26日 23-46-14_QQ浏览器网页保存_QQ浏览器转格式(6).docx
- 直接插入排序,冒泡排序,直接选择排序.zip
- 在排序2的基础上,再次对快排进行优化,其次增加快排非递归,归并排序,归并排序非递归版.zip
- 实现了7种排序算法.三种复杂度排序.三种nlogn复杂度排序(堆排序,归并排序,快速排序)一种线性复杂度的排序.zip
- 冒泡排序 直接选择排序 直接插入排序 随机快速排序 归并排序 堆排序.zip
资源上传下载、课程学习等过程中有任何疑问或建议,欢迎提出宝贵意见哦~我们会及时处理!
点击此处反馈
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功