Skip to main content
SpringerLink
Log in

Network Optimization

  • Conference proceedings
  • © 1997

Overview

Editors:
  1. Panos M. Pardalos

    1. Center for Applied Optimization ISE Department, University of Florida, Gainesville, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Donald W. Hearn

    1. Center for Applied Optimization ISE Department, University of Florida, Gainesville, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. William W. Hager

    1. Math Department, University of Florida, Gainesville, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Economics and Mathematical Systems (LNE, volume 450)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (23 papers)

  1. Front Matter

    Pages I-VIII
    Download chapter PDF

  2. A Pavement Network Optimization System Using Dantzig-Wolfe Decomposition

    • E. Alviti, E. G. Johnson, R. B. Kulkarni, J. L. Nazareth, J. C. Stone
    Pages 1-16

  3. Integer Multicommodity Flow Problems

    • Cynthia Barnhart, Christopher A. Hane, Pamela H. Vance
    Pages 17-31

  4. Solution Methods for Nonconvex Network Flow Problems

    • Gavin J. Bell, Bruce W. Lamar
    Pages 32-50

  5. Congestion Toll Pricing of Traffic Networks

    • Pia Bergendorff, Donald W. Hearn, Motakuri V. Ramana
    Pages 51-71

  6. Solving the Nonadditive Traffic Equilibrium Problem

    • David Bernstein, Steven A. Gabriel
    Pages 72-102

  7. É›-Relaxation and Auction Methods for Separable Convex Cost Network Flow Problems

    • Dimitri P. Bertsekas, Lakis C. Polymenakos, Paul Tseng
    Pages 103-126

  8. A Communication Assignment Problem on Trees: Heuristics and Asymptotic Behavior

    • Rainer E. Burkard, Eranda Çela, Tibor Dudás
    Pages 127-155

  9. The inverse shortest paths problem with upper bounds on shortest paths costs

    • D. Burton, W. R. Pulleyblank, Ph. L. Toint
    Pages 156-171

  10. Distributed Disaggregate Simplicial Decomposition — A Parallel Algorithm for Traffic Assignment

    • Olof Damberg, Athanasios Migdalas
    Pages 172-193

  11. Computation of Constrained Spanning Trees: A Unified Approach

    • Narsingh Deo, Nishit Kumar
    Pages 196-220

  12. Two Special Cases for Rectilinear Steiner Minimum Trees

    • Ding-Zhu Du, Eugene Shragowitz, Peng-Jun Wan
    Pages 221-233

  13. Decomposition Methods for Network Optimization Problems in the Presence of Uncertainty

    • Francesco Fantauzzi, Alexei A. Gaivoronski, Enza Messina
    Pages 234-248

  14. Network Methods for Head-dependent Hydro Power Scheduling

    • S. Feltenmark, P. O. Lindberg
    Pages 249-264

  15. An Efficient Implementation of the Network Simplex Method

    • Michael Florian, Denis Lebeuf
    Pages 265-291

  16. Implementations of Dijkstra’s Algorithm Based on Multi-Level Buckets

    • Andrew V. Goldberg, Craig Silverstein
    Pages 292-327

  17. NETSPEAK: An Algebraic Modelling Language for Nonconvex Network Optimization Problems

    • Bruce W. Lamar, Chris A. Wallace
    Pages 328-345

  18. Applications of Simplicial Decomposition with Nonlinear Column Generation to Nonlinear Network Flows

    • Torbjörn Larsson, Michael Patriksson, Clas Rydergren
    Pages 346-373

  19. Massively Parallel Computation of Dynamic Traffic Networks Modeled as Projected Dynamical Systems

    • Anna Nagurney, Ding Zhang
    Pages 374-396

  20. Solving the Survivable Network Design Problem with Search Space Smoothing

    • Jong-Chul Park, Chi-Geun Han
    Pages 397-406
Back to top

Keywords

About this book

Network optimization is important in the modeling of problems and processes from such fields as engineering, computer science, operations research, transportation, telecommunication, decision support systems, manufacturing, and airline scheduling. Recent advances in data structures, computer technology, and algorithm development have made it possible to solve classes of network optimization problems that until recently were intractable. The refereed papers in this volume reflect the interdisciplinary efforts of a large group of scientists from academia and industry to model and solve complicated large-scale network optimization problems.

Editors and Affiliations

  • Center for Applied Optimization ISE Department, University of Florida, Gainesville, USA

    Panos M. Pardalos, Donald W. Hearn

  • Math Department, University of Florida, Gainesville, USA

    William W. Hager

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation