Check nearby libraries
Buy this book
This edition doesn't have a description yet. Can you add one?
Check nearby libraries
Buy this book
Showing 1 featured edition. View all 1 editions?
Edition | Availability |
---|---|
1 |
aaaa
Libraries near you:
WorldCat
|
Book Details
Table of Contents
Algorithms for maximum network flow
Threshold assignment algorithm
Shortest path methods: A unifying approach
On a nonbasic dual method for the transportation problem
An efficient implementation of the network simplex method
Tailoring Benders decomposition for uncapacitated network design
An algorithm for the Rural Postman problem on a directed graph
Nonlinear cost network models in transportation analysis
Variations on the integral decomposition property
A short note on matching algorithms
Common aspects of several network flow algorithms
Finding all optimal solutions to the network flow problem
A heuristic procedure for calculating telecommunication transmission networks in consideration of network reliability
A linear programming approach to the optimum network orientation problem
Computational comparison of two solution procedures for allocation/processing networks
Advanced start for the multicommodity network flow problem
A class of network design problems with multiple demand: Model formulation and an algorithmic approach
Some experience in applying a stochastic method to location problems
A new heuristic for determining fleet size and composition
Solving integer minimum cost flows with separable convex cost objective polynomially
A motivation for using the truncated Newton approach in a very large scale nonlinear network problem
The performance of NLPNET, a large-scale nonlinear network optimizer
Vehicle routing and scheduling with time windows
A game-theoretic approach to network equilibrium.
Edition Notes
Classifications
ID Numbers
Community Reviews (0)
Feedback?December 8, 2022 | Created by MARC Bot | import new book |