MULTICOMMODITY NETWORK FLOWS WITH NONCONVEX ARC COSTS

AUTOR(ES)

Mahey, Philippe, Souza, Mauricio C. de

FONTE

Pesqui. Oper.

DATA DE PUBLICAÇÃO

2017-09

RESUMO

ABSTRACT We present a survey on nonconvex models and algorithms for multicommodity network design problems. We put in perspective the alternative modelling of these problems, traditionally represented by mixed-integer linear programs, by separable nonconvex arc cost functions. We show in particular that some problems take profit of a continuous modelling and explore the case of capacity expansion of communications networks.

Documentos Relacionados

• FLOWS WITH CROSS SECTIONS
• Modelando o projeto logístico de uma indústria multicommodity
• Mercados futuros: custos de transação associados à tributação, margem, ajustes e estrutura financeira.
• A CONVEX APPROXIMANT METHOD FOR NONCONVEX EXTENSIONS OF GEOMETRIC PROGRAMMING*
• Using sentinels to detect intersections of convex and nonconvex polygons