Decomposition Methods and Network Design Problems
Decomposition based approaches are recalled from primal and dual point of view. The possibility of building partially disaggregated reduced master problems is investigated. This extends the idea of aggregated-versus-disaggregated formulation to a gradual choice of alternative level of aggregation. P...
Main Author: | Parriani, Tiziano <1984> |
---|---|
Other Authors: | Lodi, Andrea |
Format: | Doctoral Thesis |
Language: | en |
Published: |
Alma Mater Studiorum - Università di Bologna
2014
|
Subjects: | |
Online Access: | http://amsdottorato.unibo.it/6551/ |
Similar Items
-
Decomposition and reformulation of integer linear programming problems
by: Furini, Fabio <1982>
Published: (2011) -
The cutting stock problem in the wood industry
by: Medina Durán, Rosa Daniela <1984>
Published: (2011) -
Heuristic algorithms for the Capacitated Location-Routing Problem and the Multi-Depot Vehicle Routing Problem
by: Escobar Velasquez, John Willmer <1980>
Published: (2013) -
Algorithms for Combinatorial Optimization Problems
by: Naji Azimi, Zahra <1982>
Published: (2010) -
Formulations and Algorithms for Routing Problems
by: Salari, Majid <1982>
Published: (2010)