Primal-Dual Methods and Minimum Cost Flow

Ding-Zhu Du, Panos Pardalos, Xiaodong Hu and Weili Wu
Additional contact information
Ding-Zhu Du: University of Texas, Dallas
Panos Pardalos: University of Florida
Xiaodong Hu: Chinese Academy of Sciences
Weili Wu: University of Texas at Dallas

Chapter Chapter 7 in Introduction to Combinatorial Optimization, 2022, pp 175-198 from Springer

Abstract: Abstract There are three types of incremental methods, primal, dual, and primal-dual. In Chap. 6, we touched all of them for linear programming (LP). This chapter is contributed specially to primal-dual methods for further exploring techniques about primal-dual with a special interest in the minimum cost flow. Actually, the minimum cost flow is a fundamental optimization problem on networks. The shortest path problem and the assignment problem can be formulated as its special cases. We begin with the study of the assignment problem.

Date: 2022
References: Add references at CitEc
Citations: View citations in EconPapers (1)

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:spochp:978-3-031-10596-8_7

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

DOI: 10.1007/978-3-031-10596-8_7

Access Statistics for this chapter

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