A fast bipartite network flow algorithm for selective assembly

Authors:
Satoru Iwata;Tomomi Matsui;S.Thomas Mccormick
Affiliations:
Graduate School of Engineering Science, Osaka University, Toyonaka 560, Japan;Department of Mathematical Engineering and Information Physics, University of Tokyo, Tokyo 113, Japan;Faculty of Commerce and Business Administration, University of British Columbia, Vancouver, BC V6T 1Z2 Canada
Venue:
Operations Research Letters
Year:
1998

Citing 11
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Monge and feasibility sequences in general flow problems

Discrete Applied Mathematics
Fast algorithms for parametric scheduling come from extensions to parametric maximum flow

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Perspectives of Monge properties in optimization

Discrete Applied Mathematics
Characterization and algorithms for greedily solvable transportation problems

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
PQ-tree algorithms.

PQ-tree algorithms.
Newton's method for fractional combinatorial optimization

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Efficient minimum cost matching using quadrangle inequality

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences
An O(n log n) algorithm for the convex bipartite matching problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that take advantage of special properties of the associated bipartite networks. We show a connection between selective assembly and the earliest due date (EDD) scheduling rule, and we show that EDD can be implemented in linear time when the data are already sorted. Our main result uses a Monge property to get a linear-time algorithm for selective assembly with a monotone convex loss function.