Netflow at Pisa
保存先:
| 第一著者: | |
|---|---|
| その他の著者: | |
| フォーマット: | Livre numérique |
| 言語: | Anglais |
| 出版事項: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| シリーズ: | Mathematical programming studies
26 |
| 主題: | |
| オンライン･アクセス: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| 注記: |
Actes d'un séminaire tenu à Pise du 29 au 31 mars 1983, d'après la préface Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Netflow at Pisa, Texte imprimé, 9783642009228 |
目次:
- 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.