A deterministic annealing algorithm for the minimum concave cost network flow problem (Q1952548)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A deterministic annealing algorithm for the minimum concave cost network flow problem |
scientific article; zbMATH DE number 6169046
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A deterministic annealing algorithm for the minimum concave cost network flow problem |
scientific article; zbMATH DE number 6169046 |
Statements
A deterministic annealing algorithm for the minimum concave cost network flow problem (English)
0 references
31 May 2013
0 references
concave cost
0 references
network flow
0 references
combinatorial optimization
0 references
Lagrange multiplier
0 references
barrier function
0 references
Lagrange and barrier function
0 references
descent direction
0 references
iterative method
0 references
deterministic annealing
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.89172995
0 references
0.8882508
0 references
0.8857265
0 references
0.88394254
0 references
0.8827252
0 references
0.8815496
0 references
0.8809689
0 references
0.8793492
0 references
