Network design applications of the class of column generation/simplicial decomposition algorithms in convex differentiable optimization (Q2783479)
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: Network design applications of the class of column generation/simplicial decomposition algorithms in convex differentiable optimization |
scientific article; zbMATH DE number 1730455
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Network design applications of the class of column generation/simplicial decomposition algorithms in convex differentiable optimization |
scientific article; zbMATH DE number 1730455 |
Statements
21 April 2002
0 references
convex programming
0 references
capacitated network design
0 references
multicommodity flow problems
0 references
0.8805887
0 references
0.8743703
0 references
0.8724686
0 references
0.86615896
0 references
0.86569417
0 references
0.8617733
0 references
Network design applications of the class of column generation/simplicial decomposition algorithms in convex differentiable optimization (English)
0 references
Some properties of column generation simplicial decomposition methods are reviewed and an algorithm is developed. Its application to tactical railway freight transportation problems is considered and a centralized network flow design problem is modeled. Two applications are described: a centralized network design problem (NDP), which is modeled by a mixed integer programming and a bilevel NDP, which is solved using simulated annealing.
0 references
