An edition of Netflow at Pisa (1986)

Netflow at Pisa

by

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read
Netflow at Pisa
Giorgio Gallo
Not in Library

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today
Notes
  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read
Notes

Check nearby libraries

Buy this book

Last edited by MARC Bot
December 8, 2022 | History
Edit
An edition of Netflow at Pisa (1986)

Netflow at Pisa

by

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read

This edition doesn't have a description yet. Can you add one?

Publish Date
Publisher
Springer Berlin Heidelberg
Language
English

Check nearby libraries

Buy this book

Subjects
Mathematics, Computer science, Mathematical optimization, Mathematics of Computing, Optimization

Showing 1 featured edition. View all 1 editions?

Edition Availability
Cover of: Netflow at Pisa
Netflow at Pisa
1986, Springer Berlin Heidelberg
in English
  • Not in Library
Libraries near you: WorldCat

Add another edition?

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

Published in
Berlin, Heidelberg
Series
Mathematical Programming Studies -- 26, Mathematical programming study -- 26.

Classifications

Dewey Decimal Class
519.6
Library of Congress
QA402.5-402.6

ID Numbers

Open Library
OL43337746M
ISBN 13
9783642009235, 9783642009228

Source records

harvard_bibliographic_metadata record

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON / OPDS | Wikipedia citation
December 8, 2022 Created by MARC Bot Imported from harvard_bibliographic_metadata record