- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Report in Wirtschaftsmathematik (WIMA Report) ; 88
- Keyword
-
Network flows
Earliest arrival augmenting path
Dynamic cut
- Event
-
Veröffentlichung
- (where)
-
Kaiserslautern
- (who)
-
Technische Universität Kaiserslautern, Fachbereich Mathematik
- (when)
-
2003
- Creator
-
Hamacher, Horst W.
Tjandra, Stevanus A.
- URN
-
urn:nbn:de:hbz:386-kluedo-12705
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:24 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Hamacher, Horst W.
- Tjandra, Stevanus A.
- Technische Universität Kaiserslautern, Fachbereich Mathematik
Time of origin
- 2003
Other Objects (12)
Semi-Simultaneous Flows and Binary Constrained (Integer) Linear Programs
Algorithms for Time-Dependent Bicriteria Shortest Path Problems : (revised version)
Wie Geometrie zu einem anwendungsbezogenen und alltagsrelevanten Mathematikunterricht beitragen kann
Hierarchical Edge Colorings and Rehabilitation Therapy Planning in Germany
An Integer Network Flow Problem with Bridge Capacities
Algorithms for Time Dependent Bicriteria Shortest Path Problems
Optimizacíon lineal en las clases de matemáticas
Inverse radiation therapy planning - a multiple objective optimisation approach
A Note On Inverse Max Flow Problem Under Chebyshev Norm
The Multi Terminal q-FlowLoc Problem: A Heuristic
Bicriteria approach to the optimal location of surveillance cameras
Hub Cover and Hub Center Problems
Semi-Simultaneous Flows and Binary Constrained (Integer) Linear Programs
Algorithms for Time-Dependent Bicriteria Shortest Path Problems : (revised version)
Wie Geometrie zu einem anwendungsbezogenen und alltagsrelevanten Mathematikunterricht beitragen kann
Hierarchical Edge Colorings and Rehabilitation Therapy Planning in Germany
An Integer Network Flow Problem with Bridge Capacities
Algorithms for Time Dependent Bicriteria Shortest Path Problems
Optimizacíon lineal en las clases de matemáticas
Inverse radiation therapy planning - a multiple objective optimisation approach
A Note On Inverse Max Flow Problem Under Chebyshev Norm
The Multi Terminal q-FlowLoc Problem: A Heuristic
Bicriteria approach to the optimal location of surveillance cameras
Hub Cover and Hub Center Problems
Semi-Simultaneous Flows and Binary Constrained (Integer) Linear Programs
Algorithms for Time-Dependent Bicriteria Shortest Path Problems : (revised version)
Wie Geometrie zu einem anwendungsbezogenen und alltagsrelevanten Mathematikunterricht beitragen kann
Hierarchical Edge Colorings and Rehabilitation Therapy Planning in Germany
An Integer Network Flow Problem with Bridge Capacities
Algorithms for Time Dependent Bicriteria Shortest Path Problems
Optimizacíon lineal en las clases de matemáticas
Inverse radiation therapy planning - a multiple objective optimisation approach
A Note On Inverse Max Flow Problem Under Chebyshev Norm
The Multi Terminal q-FlowLoc Problem: A Heuristic
Bicriteria approach to the optimal location of surveillance cameras