Network optimization. Conference, Center for Applied Optimization, Univ. of Florida, Gainesville, FL, USA, February 12-14, 1996 (Q1354951)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Alviti, E.; Johnson, E. G.; Kulkarni, R. B.; Nazareth, J. L.; Stone, J. C.}, A pavement network optimization system usign Dantzig-Wolfe decomposition, 1-16 [Zbl 0878.90107] \textit{Barnhart, Cynthia; Hane, Christopher A.; Vance, Pamela H.}, Integer multicommodity flow problems, 17-31 [Zbl 0878.90028] \textit{Bell, Gavin J.; Lamar, Bruce W.}, Solution method for nonconvex network flow problems, 32-50 [Zbl 0878.90029] \textit{Bergendorff, Pia; Hearn, Donald W.; Ramana, Motakuri V.}, Congestion toll pricing of traffic networks, 51-71 [Zbl 0878.90040] \textit{Bernstein, David; Gabriel, Steven A.}, Solving the nonadditive traffic equilibrium problem, 72-102 [Zbl 0878.90030] \textit{Bertsekas, Dimitri P.; Polymenakos, Lakis C.; Tseng, Paul}, \(\varepsilon\)-relaxation and auction methods for separable convex cost network flow problems, 103-126 [Zbl 0898.90054] \textit{Burkard, Rainer E.; Çela, Eranda; Dudás, Tibor}, A communication assignment problem on trees: Heuristics and asymptotic behavior, 127-155 [Zbl 0898.90058] \textit{Burton, D.; Pulleyblank, W. R.; Toint, Ph. L.}, The inverse shortest paths problem with upper bounds on shortest paths costs, 156-171 [Zbl 0878.90098] \textit{Damberg, Olof; Migdalas, Athanasios}, Distributed disaggregate simplicial decomposition - A parallel algorithm for traffic assignment, 172-193 [Zbl 0898.90056] \textit{Deo, Narsingh; Kumar, Nishit}, Computation of constrained spanning trees: A unified approach, 194-220 [Zbl 0878.90100] \textit{Du, Ding-Zhu; Shragowitz, Eugene; Wan, Peng-Jun}, Two special cases for rectilinear Steiner minimum trees, 221-233 [Zbl 0878.90099] \textit{Fantauzzi, Francesco; Gaivoronski, Alexei A.; Messina, Enza}, Decomposition methods for network optimization problems in the presence of uncertainty, 234-248 [Zbl 0878.90101] \textit{Feltenmark, S.; Lindberg, P. O.}, Network methods for head-dependent hydro power scheduling, 249-264 [Zbl 0878.90072] \textit{Florian, Michael; Lebeuf, Denis}, An efficient implementation of the network simplex method, 265-291 [Zbl 0878.90032] \textit{Goldberg, Andrew V.; Silverstein, Craig}, Implementations of Dijkstra's algorithm based on multi-level buckets, 292-327 [Zbl 0898.90128] \textit{Lamar, Bruce W.; Wallace, Chris A.}, NetSpeak: An algebraic modelling language for nonconvex network optimization problems, 328-345 [Zbl 0878.90034] \textit{Larsson, Torbjörn; Patriksson, Michael; Rydergren, Clas}, Applications of simplicial decomposition with nonlinear column generation to nonlinear network flows, 346-373 [Zbl 1126.90308] \textit{Nagurney, Anna; Zhang, Ding}, Massively parallel computation of dynamic traffic networks modeled as projected dynamical systems, 374-396 [Zbl 0878.90035] \textit{Park, Jong-Chul; Han, Chi-Geun}, Solving the survivable network design problem with search space smoothing, 397-406 [Zbl 0878.90038] \textit{Poore, Aubrey B.; Drummond, Oliver E.}, Track initiation and maintenance using multidimensional assignment problems, 407-422 [Zbl 0878.90109] \textit{Powell, Warren B.; Chen, Zhi-Long}, An optimal control formulation of large-scale multiclass machine scheduling problems, 423-440 [Zbl 0878.90064] \textit{Trafalis, Theodore B.; Tutunji, Tarek A.; Couëllan, Nicolas P.}, Interior point methods for supervised training of artificial neural networks with bounded weights, 441-470 [Zbl 1126.90423] \textit{Villavicencio, Jorge; Grigoriadis, Michael D.}, Approximate Lagrangian decomposition with a modified Karmarkar logarithmic potential, 471-485 [Zbl 0878.90037]