Dynamic graph generation for the shortest path problem in time expanded networks

In discrete optimization problems the progress of objects over time is frequently modeled by shortest path problems in time expanded networks, but longer time spans or finer time discretizations quickly lead to problem sizes that are intractable in practice. In convex relaxations the arising shortes...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Mathematical programming Ročník 143; číslo 1-2; s. 257 - 297
Hlavní autoři:	Fischer, Frank, Helmberg, Christoph
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.02.2014 Springer Nature B.V
Témata:	Algorithms Analysis Calculus of Variations and Optimal Control; Optimization Combinatorics Corridors Full Length Paper Graph theory Graphs Lagrange multiplier Mathematical and Computational Physics Mathematical Methods in Physics Mathematical programming Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Optimization Studies Theoretical Large scale optimization 90B10 Time expanded networks Column generation 90C35 Lagrangian relaxation Dynamic graph generation 90C06
ISSN:	0025-5610, 1436-4646
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!