A method is presented to solve that class of network flow problems, which may be formulated as one source - multiple destination minimum cost flow problems with concave costs. The global optimum is searched using a branch and bound procedure, in which the enumeration scheme is based on a characterization of the optimal solution set, while linear relaxations of the original problem provide lower bounds. © 1980.
An algorithm for the min concave cost flow problem
1980
Abstract
A method is presented to solve that class of network flow problems, which may be formulated as one source - multiple destination minimum cost flow problems with concave costs. The global optimum is searched using a branch and bound procedure, in which the enumeration scheme is based on a characterization of the optimal solution set, while linear relaxations of the original problem provide lower bounds. © 1980.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_421811-doc_149855.pdf
solo utenti autorizzati
Descrizione: An algorithm for the min concave cost flow problem
Tipologia:
Versione Editoriale (PDF)
Dimensione
1.37 MB
Formato
Adobe PDF
|
1.37 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
