scientific article; zbMATH DE number 515938
From MaRDI portal
Publication:4283454
zbMATH Open0788.90049MaRDI QIDQ4283454FDOQ4283454
Authors: K. Ramakrishnan, Narendra K. Karmarkar, Anil P. Kamath 
Publication date: 10 March 1994
Title of this publication is not available (Why is that?)
Recommendations
- A new algorithm for the assignment problem: An alternative to the Hungarian method
- A new method for solving the assignment problem based on the permissible-edge algorithm for the minimum cost flow problem
- A simple dual algorithm for the generalised assignment problem
- scientific article; zbMATH DE number 17627
- A labeling algorithm to solve the assignment problem
Numerical mathematical programming methods (65K05) Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35) Iterative numerical methods for linear systems (65F10)
Cited In (13)
- A new method for solving the assignment problem based on the permissible-edge algorithm for the minimum cost flow problem
- A sequential dual simplex algorithm for the linear assignment problem
- Towards auction algorithms for large dense assignment problems
- An implementation of linear and nonlinear multicommodity network flows
- Title not available (Why is that?)
- A 3 / 2 -approximation Algorithm for the Student-Project Allocation Problem
- An efficient cost scaling algorithm for the assignment problem
- On the expected optimal value of random assignment problems: Experimental results and open questions
- A simple dual algorithm for the generalised assignment problem
- A parametric visualization software for the assignment problem
- A least-squares minimum-cost network flow algorithm
- A heuristic for the time constrained asymmetric linear sum assignment problem
- Algorithms and codes for dense assignment problems: The state of the art
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4283454)
