## Abstract

In this paper we broadly generalize the assignment auction algorithm to solve linear minimum cost network flow problems. We introduce a generic algorithm, which contains as special cases a number of known algorithms, including the ε-relaxation method, and the auction algorithm for assignment and for transportation problems. The generic algorithm can serve as a broadly useful framework for the development and the complexity analysis of specialized auction algorithms that exploit the structure of particular network problems. Using this framework, we develop and analyze two new algorithms, an algorithm for general minimum cost flow problems, called network auction, and an algorithm for the k node-disjoint shortest path problem.

Original language | English (US) |
---|---|

Pages (from-to) | 229-259 |

Number of pages | 31 |

Journal | Computational Optimization and Applications |

Volume | 2 |

Issue number | 3 |

DOIs | |

State | Published - Nov 1993 |

Externally published | Yes |

## Keywords

- Optimization
- auction
- network programming
- transportation

## ASJC Scopus subject areas

- Control and Optimization
- Computational Mathematics
- Applied Mathematics