Models for Network Flow and Network Design Problems with Piecewise Linear Costs

Bernard Fortz (), Bernard Gendron () and Luis Gouveia ()
Additional contact information
Bernard Fortz: HEC - Management School of the University of Liège
Bernard Gendron: CIRRELT and DIRO, Université de Montréal
Luis Gouveia: Faculdade de Ciências da Universidade de Lisboa and CMAFcIO - Centro de Matemática, Aplicações Fundamentais e Investigação Operacional

A chapter in Combinatorial Optimization and Applications, 2024, pp 149-161 from Springer

Abstract: Abstract In modeling real-world applications of network design, a difficulty often encountered is the fact that capacity on the arcs are not ”all-or-nothing” but incur a more complex cost. Often, the associated cost function can be approximated with a piecewise linear function (possibly non-convex). We review in this chapter some pioneering work of Bernard Gendron on multicommodity flow and network design problems with piecewise linear costs, and we also briefly address related recent works that build on the ideas developed by Bernard Gendron.

Keywords: Networks; Unsplittable flows; Integer programming; Combinatorial optimization (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-3-031-57603-4_7

Ordering information: This item can be ordered from
http://www.springer.com/9783031576034

DOI: 10.1007/978-3-031-57603-4_7

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().