CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Network design applications of the class of column generation/simplicial decomposition algorithms in convex differentiable optimization

Ricardo Garcia ; Angel Marin ; Michael Patriksson (Institutionen för matematik, Matematik/Tillämpad matematik)
Investigacion Operacional Vol. 22 (2001), 2, p. 91-99.
[Artikel, refereegranskad vetenskaplig]

A new class of column generation/simplicial decomposition method for nonlinear convex and differentiable programming is presented. The new algorithm class builds on the intuitively appealing idea that nonlinear column generation problems may be advantageous computationally. Different applications of this methodology are presented, with special attention to the unicommodity and multicommodity network flow problems, which are obtained when some decomposition methods are applied to network design problems.



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2014-10-20.
CPL Pubid: 204556

 

Institutioner (Chalmers)

Institutionen för matematik, Matematik/Tillämpad matematik (1987-2001)

Ämnesområden

Transport
Hållbar utveckling
Optimeringslära, systemteori
Transportteknik och logistik

Chalmers infrastruktur