A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem (Q4808430)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1915358
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem |
scientific article; zbMATH DE number 1915358 |
Statements
A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem (English)
0 references
22 May 2003
0 references
network design
0 references
fixed charge
0 references
branch and cut
0 references
dicut inequalities
0 references
branching
0 references
heuristics
0 references
minimum-cost flow
0 references
0.89653873
0 references
0.8949971
0 references
0.8884976
0 references
0.8844723
0 references
0.88073826
0 references
0.87968266
0 references
0.8770615
0 references
