Lecture Notes in Economics and Mathematical Systems - Network Optimization
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540625414, 9783642591792

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Solving the Survivable Network Design Problem with Search Space Smoothing

Lecture Notes in Economics and Mathematical Systems - Network Optimization ◽

10.1007/978-3-642-59179-2_19 ◽

1997 ◽

pp. 397-406 ◽

Cited By ~ 1

Author(s):

Jong-Chul Park ◽

Chi-Geun Han

Keyword(s):

Network Design ◽

Design Problem ◽

Search Space ◽

Network Design Problem ◽

Survivable Network Design ◽

Survivable Network

Decomposition Methods for Network Optimization Problems in the Presence of Uncertainty

Lecture Notes in Economics and Mathematical Systems - Network Optimization ◽

10.1007/978-3-642-59179-2_12 ◽

1997 ◽

pp. 234-248 ◽

Cited By ~ 1

Author(s):

Francesco Fantauzzi ◽

Alexei A. Gaivoronski ◽

Enza Messina

Keyword(s):

Network Optimization ◽

Optimization Problems ◽

Decomposition Methods

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

Lecture Notes in Economics and Mathematical Systems - Network Optimization ◽

10.1007/978-3-642-59179-2_8 ◽

1997 ◽

pp. 156-171 ◽

Cited By ~ 18

Author(s):

D. Burton ◽

W. R. Pulleyblank ◽

Ph. L. Toint

Keyword(s):

Shortest Paths ◽

Upper Bounds

A Communication Assignment Problem on Trees: Heuristics and Asymptotic Behavior

Lecture Notes in Economics and Mathematical Systems - Network Optimization ◽

10.1007/978-3-642-59179-2_7 ◽

1997 ◽

pp. 127-155

Author(s):

Rainer E. Burkard ◽

Eranda Çela ◽

Tibor Dudás

Keyword(s):

Asymptotic Behavior ◽

Assignment Problem

Solution Methods for Nonconvex Network Flow Problems

Lecture Notes in Economics and Mathematical Systems - Network Optimization ◽

10.1007/978-3-642-59179-2_3 ◽

1997 ◽

pp. 32-50 ◽

Cited By ~ 2

Author(s):

Gavin J. Bell ◽

Bruce W. Lamar

Keyword(s):

Network Flow ◽

Network Flow Problems ◽

Flow Problems ◽

Solution Methods

Approximate Lagrangian Decomposition with a Modified Karmarkar Logarithmic Potential

Lecture Notes in Economics and Mathematical Systems - Network Optimization ◽

10.1007/978-3-642-59179-2_23 ◽

1997 ◽

pp. 471-485 ◽

Cited By ~ 15

Author(s):

Jorge Villavicencio ◽

Michael D. Grigoriadis

Keyword(s):

Logarithmic Potential ◽

Lagrangian Decomposition

Track Initiation and Maintenance Using Multidimensional Assignment Problems

Lecture Notes in Economics and Mathematical Systems - Network Optimization ◽

10.1007/978-3-642-59179-2_20 ◽

1997 ◽

pp. 407-422 ◽

Cited By ~ 2

Author(s):

Aubrey B. Poore ◽

Oliver E. Drummond

Keyword(s):

Assignment Problems ◽

Track Initiation ◽

Multidimensional Assignment Problems

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

Lecture Notes in Economics and Mathematical Systems - Network Optimization ◽

10.1007/978-3-642-59179-2_17 ◽

1997 ◽

pp. 346-373 ◽

Cited By ~ 4

Author(s):

Torbjörn Larsson ◽

Michael Patriksson ◽

Clas Rydergren

Keyword(s):

Column Generation ◽

Network Flows ◽

Simplicial Decomposition ◽

Nonlinear Network

NETSPEAK: An Algebraic Modelling Language for Nonconvex Network Optimization Problems

Lecture Notes in Economics and Mathematical Systems - Network Optimization ◽

10.1007/978-3-642-59179-2_16 ◽

1997 ◽

pp. 328-345 ◽

Cited By ~ 1

Author(s):

Bruce W. Lamar ◽

Chris A. Wallace

Keyword(s):

Network Optimization ◽

Optimization Problems ◽

Modelling Language ◽

Algebraic Modelling

Two Special Cases for Rectilinear Steiner Minimum Trees

Lecture Notes in Economics and Mathematical Systems - Network Optimization ◽

10.1007/978-3-642-59179-2_11 ◽

1997 ◽

pp. 221-233

Author(s):

Ding-Zhu Du ◽

Eugene Shragowitz ◽

Peng-Jun Wan

Keyword(s):

Special Cases

Lecture Notes in Economics and Mathematical Systems - Network OptimizationLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Solving the Survivable Network Design Problem with Search Space Smoothing

Decomposition Methods for Network Optimization Problems in the Presence of Uncertainty

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

A Communication Assignment Problem on Trees: Heuristics and Asymptotic Behavior

Solution Methods for Nonconvex Network Flow Problems

Approximate Lagrangian Decomposition with a Modified Karmarkar Logarithmic Potential

Track Initiation and Maintenance Using Multidimensional Assignment Problems

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

NETSPEAK: An Algebraic Modelling Language for Nonconvex Network Optimization Problems

Two Special Cases for Rectilinear Steiner Minimum Trees

Lecture Notes in Economics and Mathematical Systems - Network Optimization
Latest Publications