Incremental Method and Maximum Network 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 5 in Introduction to Combinatorial Optimization, 2022, pp 97-128 from Springer

Abstract: Abstract In this chapter, we study the incremental method which is very different from those methods in the previous chapters. This method does not use the self-reducibility. It starts from a feasible solution, and in each iteration, computation moves from a feasible solution to another feasible solution by improving the objective function value. The incremental method has been used in the study of many problems, especially in the study of network flow.

Date: 2022
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:spochp:978-3-031-10596-8_5

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

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

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 ().