The complexity of the multicommodity uncapacited network flow design problem with bounded decomposability.
Year of publication: |
1990
|
---|---|
Authors: | Schaffers, M. |
Institutions: | Center for Operations Research and Econometrics (CORE), École des Sciences Économiques de Louvain |
Subject: | commodities | costs |
-
Effective bid-ask spreads in futures versus futures options
Shah, Samarth, (2012)
-
Optimal institutional mechanisms for funding generic advertising : an experimental analysis
Messer, Kent D., (2005)
-
Optimal institutional mechanisms for funding generic advertising : an experimental analysis
Messer, Kent D., (2004)
- More ...
-
Schaffers, M., (1990)
-
A polynomial algorithm for the single source network flow design problem on series-parallel graphs
Schaffers, M., (1990)
-
A polynomial algorithm for the single source network flow design problem on series-parallel graphs.
Schaffers, M., (1990)
- More ...