The alternating basis algorithm for assignment problems
From MaRDI portal
Publication:4159200
Cites work
- A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
- A network simplex method
- Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
- An improved version of the out-of-kilter method and a comparative study of computer codes
- Augmented Threaded Index Method For Network Optimization
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
- 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
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
Cited in
(44)- A strongly polynomial simplex method for the linear fractional assignment problem
- The assignment problem under categorized jobs
- An efficient algorithm for the bipartite matching 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
- A sequential dual simplex algorithm for the linear assignment problem
- The generalized alternating path algorithm for transportation problems
- Determining dominant wind directions
- Algorithms for network piecewise-linear programs: A comparative study
- 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
- The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm
- The auction algorithm: A distributed relaxation method for the assignment problem
- Max-min matching problems with multiple assignments
- A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem
- Bottleneck assignment problems under categorization
- Algorithm for the solution of the assignment problem for sparse matrices
- An extreme point algorithm for a local minimum solution to the quadratic assignment problem
- The singly constrained assignment problem: An AP basis algorithm
- Algorithms and codes for dense assignment problems: The state of the art
- A new algorithm for solving a special matching problem with a general form value function under constraints
- An extended assignment problem considering multiple inputs and outputs
- Minimum-cost flow algorithms: an experimental evaluation
- On cycling in the network simplex method
- A unified framework for primal-dual methods in minimum cost network flow problems
- Efficient dual simplex algorithms for the assignment problem
- A competitive (dual) simplex method for the assignment problem
- Primal transportation and transshipment algorithms
- A new algorithm for the assignment problem
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis
- A specialized network simplex algorithm for the constrained maximum flow problem
- Fast primal-dual update against local weight update in linear assignment problem and its application
- A genuinely polynomial primal simplex algorithm for the assignment problem
- Computational experience with exterior point algorithms for the transportation problem
- Basis properties and algorithmic specializations for GUB transformed networks
- An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems
- An infeasible (exterior point) simplex algorithm for assignment problems
- Bilevel time minimizing assignment problem
- A survey of dynamic network flows
- The auction algorithm for the transportation problem
This page was built for publication: The alternating basis algorithm for assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4159200)
