The singly constrained assignment problem: An AP basis algorithm
From MaRDI portal
Publication:1908532
DOI10.1007/BF01300862zbMath0841.90096MaRDI QIDQ1908532
Jeffrey L. Kennington, Farin Mohammadi
Publication date: 31 March 1996
Published in: Computational Optimization and Applications (Search for Journal in Brave)
90C35: Programming involving graphs or networks
90C10: Integer programming
90C05: Linear programming
90B80: Discrete location and assignment
90C09: Boolean programming
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- A Lagrangean relaxation method for the constrained assignment problem
- The auction algorithm: A distributed relaxation method for the assignment problem
- Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint
- Matching problems with generalized upper bound side constraints
- Signature Methods for the Assignment Problem
- A competitive (dual) simplex method for the assignment problem
- Resource-Constrained Assignment Scheduling
- Solving the Assignment Problem by Relaxation
- A new algorithm for the assignment problem
- A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem
- Implementing the Simplex Method: The Initial Basis
- Solving Constrained Transportation Problems
- The alternating basis algorithm for assignment problems
- A streamlined simplex approach to the singly constrained transportation problem