A Book About Network Design

Teodor Gabriel Crainic (), Michel Gendreau () and Bernard Gendron ()
Additional contact information
Teodor Gabriel Crainic: Université du Québec à Montréal
Michel Gendreau: Polytechnique Montréal
Bernard Gendron: Université de Montréal

Chapter Chapter 1 in Network Design with Applications to Transportation and Logistics, 2021, pp 1-11 from Springer

Abstract: Abstract Network design problems arise whenever optimal choices have to be made that can be represented conceptually as the selection of a subset of links in a graph. Typically, these optimal choices are the result of complex tradeoffs between various types of costs and constraints. In particular, most network design problems involve fixed costs associated with link selection and variable costs associated with flows (of people, goods, information,…). Because of their combinatorial nature and the complexity of their objective functions and constraints, network design problems are inherently difficult (most of them are N P $$\mathcal {N}\mathcal {P}$$ -hard). For this reason, models and algorithms for network design problems involve approaches from several areas of combinatorial optimization and mathematical programming.

Date: 2021
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:sprchp:978-3-030-64018-7_1

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

DOI: 10.1007/978-3-030-64018-7_1

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().