A faster polynomial algorithm for the constrained maximum flow problem

The constrained maximum flow problem is a variant of the classical maximum flow problem in which the flow from a source node to a sink node is maximized in a directed capacitated network with arc costs subject to the constraint that the total cost of flow should be within a budget. It is important t...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computers & operations research Ročník 39; číslo 11; s. 2634 - 2641
Hlavný autor:	CALISKAN, Cenk
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Kidlington Elsevier Ltd 01.11.2012 Elsevier Pergamon Press Inc
Predmet:	Algorithms Applied sciences Combinatorial analysis Comparative studies Computational complexity Computer science; control theory; systems Computer systems and distributed systems. User interface Constraints Costs Exact sciences and technology Flows in networks. Combinatorial problems Inventory control, production control. Distribution Logistics Maximum flow Minimum cost network flow Network flow problem Network flows Operational research and scientific management Operational research. Management science Operations research Polynomials Scaling Shortest-path problems Software Transportation problem Transportation problem (Operations research) Scaling Minimum cost network flow Network flows Computational complexity Maximum flow Costs Network flow Assignment problem Combinatorial problem Empirical method Shortest path Graph theory Distributed system Combinatorial optimization Source sink relationship Source flow Transportation problem Computer network Time average Telecommunication network Budget Capacity constraint Optimal flow Logistics
ISSN:	0305-0548, 1873-765X, 0305-0548
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!