Distributed Disaggregate Simplicial Decomposition — A Parallel Algorithm for Traffic Assignment

Damberg, Olof; Migdalas, Athanasios

doi:10.1007/978-3-642-59179-2_9

Cited by 5 publications

(2 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The computational results of the proposed algorithm demonstrates its efficiency and effectiveness in order to solve such problems. Moreover, the proposed algorithm is suitable for parallel implementation (see e.g Damberg and Migdalas (1997)) for an early attempt with similar approach. Cooper and LeBlanc (1977).…”

Section: Computational Resultsmentioning

confidence: 99%

“…However, the solution of the restricted master problems does require the application of, in general, infinitely converging algorithms, several of which have been proposed in the literature, including projected second-order methods such as Newton methods (Bertsekas 1982b;Bertsekas and Gafni 1983;Bertsekas et al (1984)), reduced gradient methods (Larsson and Patriksson 1992;Patriksson 2001), and modified Frank-Wolfe algorithms. In Damberg and Migdalas (1997) and Karakitsiou et al (2005) the restricted master problems are solved by applying a regularized Frank-Wolfe approach of Subsect. 3.2.1.…”

Section: Simplicial Decompositionmentioning

confidence: 99%

See 1 more Smart Citation

Convex optimization problems in supply chain planning and their solution by a column generation method based on the Frank Wolfe method

Karakitsiou

Migdalas

2015

Oper Res Int J

View full text Add to dashboard Cite

Many problems in supply chain optimization concern the minimization of a differentiable convex objective function subject to a set of linear constraints. The aim of this work is to present a number of such problems and to propose an efficient method for their solution. The proposed method is based on improvements of the well known Frank-Wolfe algorithm. The computational results of the proposed algorithm demonstrate its effectiveness and efficiency.

show abstract

Section: Computational Resultsmentioning

confidence: 99%