Network routing
著者
書誌事項
Network routing
(Handbooks in operations research and management science / editors, G.L. Nemhauser, A.H.G. Rinnooy Kan, v. 8)
Elsevier, 1995
大学図書館所蔵 全83件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references and index
内容説明・目次
内容説明
The papers in this volume consider a general area of study known as network routing. The underlying problems are conceptually simple, yet mathematically complex and challenging. How can we best route material or people from one place to another? Or, how can we best design a system (for instance locate facilities) to provide services and goods as efficiently and equitably as possible? The problems encountered in answering these questions often have an underlying combinatorial structure, for example, either we dispatch a vehicle or we do not, or we use one particular route or another. The problems also typically have an underlying network structure (a communication or transportation network). In addition, models for these problems are often very large with hundreds or thousands of constraints and variables. A companion volume in the "Handbook" series, entitled "Network Models", treats basic network models such as minimum cost flows, matching and the travelling salesman problem, as well as, several complex network topics, not directly related to routing, such as network design and network reliability.
目次
- Part 1 Vehicle routing, M. Fisher: first generation research - simple heuristics
- generation two - mathematical programming based heuristics
- generation 3. Part 2 Time constrained routing and scheduling, J. Desrosiers et al: fixed schedule problems
- the travelling salesman problem with time windows
- constrained shortest path problems
- the vehicle routing problem with time windows
- pick-up and delivery problems with time windows
- a unified framework for fleet and crew scheduling problems
- conclusions and perspectives. Part 3 Stochastic and dynamic networks and routing, W.B. Powell et al: a priori (two-stage) stochastic models
- modelling issues for dynamic problems
- dynamic models in transportation and logistics
- algorithms and formulations for deterministic dynamic networks
- infinite horizon network models
- stochastic programming for networks
- stochastic programming models in networks and routing
- approximations for networks with random arc capacities
- evaluating dynamic models. Part 4 Analysis of vehicle routing and inventory-routing problems, A. Federgruen and D. Simchi-Levi: the capacitated vehicle routing problem (CVRP) with split demands
- the CVRP with unequal demands
- inventory-routing models
- the multi-depot CVRP
- generalizations and extensions. Part 5 Arch routing methods and applications, A.A. Assad and B.L. Golden: the classical postman problems
- the rural postman problem
- the capacitated arc routing problem
- algorithms for capacitated arc routing problems
- variants of postman problems
- arc routing for sanitation services
- postal delivery routing problems
- routing for meter reading and snow control
- applications in manufacturing and other areas
- conclusions. Part 6 Network equilibrium models and algorithms, M. Florian and D. Hearn: equivalent problems - existence and uniqueness of solutions
- some optimization reformulations
- algorithms for the symmetric NEM
- solving the asymmetric NEM
- stochastic network equilibrium
- other network equilibrium models
- reference notes. Part 7 Location on networks, M. Labbe et al: the general framework and its properties
- the median (minisum) problems
- the center (minimax problems)
- economic models of location
- discrete location problems
- conclusion. Part 8 VLSI network design, R.H. Mohring et al: layout by graph partitioning
- the divide and conquer layout algorithm
- bifurcators and separators
- bipartitioning
- from planar graphs to switchboxes
- channel routing in the knock-knee mode
- layer assignment
- Manhattan routing
- via minimization
- single layer routing
- linear layout methods
- the VLSI background
- graph-theoretic formulations and related problems
- complexity results
- algorithms. Part 9 Network models in economics, W.W. Sharkey: cost allocation on networks
- matching models in economics
- optimal pricing and allocation of waiting time in stochastic service systems
- concluding comments.
「Nielsen BookData」 より