The multicommodity network flow problem: state of the art classification, applications, and solution methods

K Salimifard, S Bigharaz - Operational Research, 2022 - Springer
Over the past decades, the Multicommodity Network Flow (MCNF) problem has grown
popular in the academic literature and a growing number of researchers are interested in …

Solving cyclic train timetabling problem through model reformulation: Extended time-space network construct and Alternating Direction Method of Multipliers methods

Y Zhang, Q Peng, Y Yao, X Zhang, X Zhou - Transportation Research Part …, 2019 - Elsevier
The cyclic train timetabling problem aims to synchronize limited operational resources
toward a master periodic schedule of transport services. By introducing an extended time …

Leverage, debt maturity and firm investment: An empirical analysis

VA Dang - Journal of business finance & accounting, 2011 - Wiley Online Library
In this paper, we examine the potential interactions of corporate financing and investment
decisions in the presence of incentive problems. We develop a system‐based approach to …

[책][B] The tail assignment problem

M Grönkvist - 2005 - Citeseer
Abstract The Aircraft Assignment problem is the problem of assigning flights to aircraft in
such a way that some operational constraints are satisfied, and possibly that some objective …

Large-scale optimization with the primal-dual column generation method

J Gondzio, P González-Brevis, P Munari - Mathematical Programming …, 2016 - Springer
The primal-dual column generation method (PDCGM) is a general-purpose column
generation technique that relies on the primal-dual interior point method to solve the …

Solving large-scale linear multicommodity flow problems with an active set strategy and proximal-ACCPM

F Babonneau, O du Merle, JP Vial - Operations Research, 2006 - pubsonline.informs.org
In this paper, we propose to solve the linear multicommodity flow problem using a partial
Lagrangian relaxation. The relaxation is restricted to the set of arcs that are likely to be …

[PDF][PDF] Network model for disaster management

A Arulselvan - 2009 - plaza.ufl.edu
Given a graph and an integer k, the objective of the critical node problem (cnp) is to find a
set of k nodes in the graph whose deletion results in the maximum network fragmentation …

ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems

F Babonneau, JP Vial - Mathematical programming, 2009 - Springer
This paper proposes an implementation of a constrained analytic center cutting plane
method to solve nonlinear multicommodity flow problems. The new approach exploits the …

An efficient method to compute traffic assignment problems with elastic demands

F Babonneau, JP Vial - Transportation Science, 2008 - pubsonline.informs.org
The traffic assignment problem (TAP) with elastic demands can be formulated as an
optimization problem, the objective of which is the sum of a congestion function and a …

Branch-and-price and multicommodity flows

FP Alvelos - 2005 - repositorium.sdum.uminho.pt
In this Thesis, we address column generation based methods for linear and integer
programming and apply them to three multicommodity flow problems. For (mixed) integer …