rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Network optimization
  name:
    name part: Pardalos, P. M. (Panos M.)
    name part: 1954-
  name:
    name part: Hearn, D. W. (Donald W.)
  name:
    name part: Hager, William W.
    name part: 1948-
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  genre: bibliography
  genre: conference publication
  genre: Electronic books.
  genre: Conference proceedings.
  origin info:
    place:
      place term: gw
    date issued: 1997
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: remote
    extent: 1 online resource (viii, 485 pages) : illustrations
  abstract: 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.
  table of contents: From the contents: A Pavement Network Optimization Sytems Using Dantzig-Wolfe Decomposition -- Solution Methods for Nonconvex Network Flow Problems -- Solving the Nonadditive Traffic Equilibrium Problem -- A Communication Assignment Problem on Trees: Heuristics and Asymptotic Behavior -- Distributed Disaggregate Simplicial Decomposition - A Parallel Algorithm for Traffic Assignment -- Two Special Cased for Rectilinear Steiner Minimum Trees -- Network Methods for Head-dependent Hydro Power Scheduling -- Implementations of Dijkstra`s Algorithm Based on Multi-Level Buckets -- Applications of Simplicial Decomposition with Nonlinear Column Generators to Nonlinear Network Flows -- Solving the Survivable Network Design Problem with Search Space Smoothing -- An Optimal Control Formulation of Large-Scale Multiclass Machine Scheduling Problems -- Approximate Lagrangian Decomposition with a Modified Karmarkar Logarithmic Potential.
  note: Panos M. Pardalos, Donald W. Hearn,William W. Hager, eds.
  note: Papers from a conference held at the Center for Applied Optimization (University of Florida), Feb. 12-14, 1996.
  note: Electronic resource.
  note: Includes bibliographical references.
  subject:
    topic: Network analysis (Planning)
    topic: Congresses
  subject:
    topic: Mathematical optimization
    genre: Congresses
  subject:
    topic: Mathematical optimization
  subject:
    topic: Network analysis (Planning)
  classification: HD30.23
  classification: 658.4/032
  related item:
    title info:
      title: Lecture notes in economics and mathematical systems ; 450
  identifier: 9783642591792 (electronic bk.)
  identifier: 3642591795 (electronic bk.)
  identifier: 3540625410
  identifier: 9783540625414
  identifier: 97000642
  identifier: http://proxy.library.tamu.edu/login
  record info:
    record content source: VT2
    record creation date: 970113
    record change date: 20260420201249.6
    record identifier: in00003553513
    language of cataloging:
      language term: eng