The alternating basis algorithm for assignment problems
From MaRDI portal
Publication:4159200
DOI10.1007/BF01584319zbMath0378.90097MaRDI QIDQ4159200
Richard S. Barr, Fred Glover, Darwin D. Klingman
Publication date: 1977
Published in: Mathematical Programming (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05)
Related Items
Efficient dual simplex algorithms for the assignment problem, An extreme point algorithm for a local minimum solution to the quadratic assignment problem, Degeneracy in transportation problems, A shortest augmenting path algorithm for dense and sparse linear assignment problems, A Lagrangean relaxation method for the constrained assignment problem, Primal-dual algorithms for the assignment problem, Max-min matching problems with multiple assignments, A competitive (dual) simplex method for the assignment problem, A sequential dual simplex algorithm for the linear assignment problem, The singly constrained assignment problem: An AP basis algorithm, Bilevel time minimizing assignment problem, Minimum-cost flow algorithms: an experimental evaluation, Fast primal-dual update against local weight update in linear assignment problem and its application, A survey of dynamic network flows, The auction algorithm for the transportation problem, Algorithms and codes for dense assignment problems: The state of the art, An extended assignment problem considering multiple inputs and outputs, A genuinely polynomial primal simplex algorithm for the assignment problem, A specialized network simplex algorithm for the constrained maximum flow problem, Computational experience with exterior point algorithms for the transportation problem, Primal transportation and transshipment algorithms, The generalized alternating path algorithm for transportation problems, A new algorithm for solving a special matching problem with a general form value function under constraints, A strongly polynomial simplex method for the linear fractional assignment problem, Determining dominant wind directions, A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem, Bottleneck assignment problems under categorization, Algorithms for network piecewise-linear programs: A comparative study, A new algorithm for the assignment problem, Algorithm for the solution of the assignment problem for sparse matrices, On cycling in the network simplex method, Basis properties and algorithmic specializations for GUB transformed networks, An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems, The assignment problem under categorized jobs, A variant of time minimizing assignment problem, A variation of the assignment problem, Selected bibliography on degeneracy, Degeneracy graphs: Theory and applications. An updated survey, A unified framework for primal-dual methods in minimum cost network flow problems, A comprehensive simplex-like algorithm for network optimization and perturbation analysis, The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm, An efficient algorithm for the bipartite matching problem, An infeasible (exterior point) simplex algorithm for assignment problems, The auction algorithm: A distributed relaxation method for the assignment problem
Uses Software
Cites Work
- A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- An improved version of the out-of-kilter method and a comparative study of computer codes
- A network simplex method
- Enhancements Of Spanning Tree Labelling Procedures For Network Optimization
- Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
- Augmented Threaded Index Method For Network Optimization
- Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
