Incremental assignment problem
From MaRDI portal
Publication:865928
DOI10.1016/j.ins.2006.05.004zbMath1109.05088OpenAlexW2125708920MaRDI QIDQ865928
Göktürk Üçoluk, Ismail Hakki Toroslu
Publication date: 20 February 2007
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2006.05.004
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Discrete location and assignment (90B80) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking ⋮ Dynamic search models with multiple items ⋮ Collaborative assignment using belief-desire-intention agent modeling and negotiation with speedup strategies ⋮ An addendum on the incremental assignment problem ⋮ Authors' response to ``An addendum on the incremental assignment problem by Volgenant
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Selected topics on assignment problems
- New scaling algorithms for the assignment and minimum mean cycle problems
- An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs
- A Decomposition Theorem for Maximum Weight Bipartite Matchings
- Algorithms for the Assignment and Transportation Problems
- Efficient dual simplex algorithms for the assignment problem
- Efficient algorithms for finding maximum matching in graphs
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
- Network Flow and Testing Graph Connectivity
- A note on the weighted matching with penalty problem
- Faster scaling algorithms for general graph matching problems
- Computing Minimum-Weight Perfect Matchings
- Paths, Trees, and Flowers
- Maximum matching and a polyhedron with 0,1-vertices
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
This page was built for publication: Incremental assignment problem
