Some recent results in the analysis of greedy algorithms for assignment problems
From MaRDI portal
Publication:1317524
DOI10.1007/BF01719448zbMath0797.90068MaRDI QIDQ1317524
Publication date: 17 March 1994
Published in: OR Spektrum (Search for Journal in Brave)
Integer programming (90C10) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New algorithms for an ancient scheduling problem.
- Minimum cost flow algorithms for series-parallel networks
- Recognition of Gilmore-Gomory traveling salesman problem
- Greedy concepts for network flow problems
- Monge sequences and a simple assignment algorithm
- An algorithm for the detection and construction of Monge sequences
- Generalized polymatroids and submodular flows
- Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations
- Submodular functions and optimization
- Series parallel composition of greedy linear programming problem
- On the Heegaard splitting of the torus \(T^ 3\)
- On the expected number of assignments in reduced matrices for the linear assignment problem
- Submodular linear programs on forests
- Characterizations of totally balanced matrices
- The asymptotic probabilistic behaviour of quadratic sum assignment problems
- Totally-Balanced and Greedy Matrices
- Probabilistic Bounds on the Performance of List Scheduling
- On a Greedy Heuristic for Complete Matching
- An Analysis of the Greedy Heuristic for Independence Systems
- Randomized greedy matching. II
- An Exact Characterization of Greedy Structures
- Online Weighted Matching
- Bounds on Multiprocessing Timing Anomalies
