Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs (Q5449668): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.20208 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4230415688 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Backbone Network Design Tools with Economic Tradeoffs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tabu Search—Part I / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tabu Search—Part II / rank | |||
Normal rank | |||
Latest revision as of 19:07, 27 June 2024
scientific article; zbMATH DE number 5248273
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs |
scientific article; zbMATH DE number 5248273 |
Statements
Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs (English)
0 references
12 March 2008
0 references
multicommodity flow problems
0 references
cycle canceling algorithms
0 references
tabu search
0 references
