TY - CHAP
T1 - Network flow problems
AU - Vanderbei, Robert J.
N1 - Publisher Copyright:
© The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2020.
PY - 2020
Y1 - 2020
N2 - Many linear programming problems can be viewed as a problem of minimizing the “transportation” cost of moving materials through a network to meet demands for material at various locations given sources of material at other locations. Such problems are called network flow problems. They form the most important special class of linear programming problems. Transportation, electric, and communication networks provide obvious examples of application areas. Less obvious, but just as important, are applications in facilities location, resource management, financial planning, and others.
AB - Many linear programming problems can be viewed as a problem of minimizing the “transportation” cost of moving materials through a network to meet demands for material at various locations given sources of material at other locations. Such problems are called network flow problems. They form the most important special class of linear programming problems. Transportation, electric, and communication networks provide obvious examples of application areas. Less obvious, but just as important, are applications in facilities location, resource management, financial planning, and others.
UR - http://www.scopus.com/inward/record.url?scp=85090013653&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85090013653&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-39415-8_14
DO - 10.1007/978-3-030-39415-8_14
M3 - Chapter
AN - SCOPUS:85090013653
T3 - International Series in Operations Research and Management Science
SP - 229
EP - 256
BT - International Series in Operations Research and Management Science
PB - Springer
ER -