Signature Methods for the Assignment Problem
From MaRDI portal
Publication:3706837
DOI10.1287/OPRE.33.3.527zbMath0583.90064OpenAlexW2117157235MaRDI QIDQ3706837
No author found.
Publication date: 1985
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.33.3.527
Trees (05C05) Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (38)
Efficient dual simplex algorithms for the assignment problem ⋮ Improving the Hungarian assignment algorithm ⋮ A shortest augmenting path algorithm for dense and sparse linear assignment problems ⋮ 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 ⋮ A new algorithm for the assignment problem: An alternative to the Hungarian method ⋮ A graph space optimal transport distance as a generalization of L p distances: application to a seismic imaging inverse problem ⋮ Transportation problems which can be solved by the use of hirsch-paths for the dual problems ⋮ Sparse dual transportation polyhedra: Extreme points and signatures ⋮ Algorithms and codes for dense assignment problems: The state of the art ⋮ Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search ⋮ Worst case examples of an exterior point algorithm for the assignment problem ⋮ Exterior point simplex-type algorithms for linear and network optimization problems ⋮ Personnel placement in a fuzzy environment ⋮ Efficient index reduction algorithm for large scale systems of differential algebraic equations ⋮ Critical objective function values in linear sum assignment problems ⋮ Perfect matchings and extended polymatroid ⋮ Polynomial-time primal simplex algorithms for the minimum cost network flow problem ⋮ A genuinely polynomial primal simplex algorithm for the assignment problem ⋮ Signature classes of transportation polytopes ⋮ Polynomial dual network simplex algorithms ⋮ A novel convex dual approach to three-dimensional assignment problem: theoretical analysis ⋮ Polarity-free automatic classification of chromosomes. ⋮ Assignment problems with changeover cost ⋮ A faster data assignment algorithm for maximum likelihood-based multitarget motion tracking with bearings-only measurements ⋮ Perfectly matchable subgraph problem on a bipartite graph ⋮ A strongly polynomial algorithm for the transportation problem ⋮ A dual approach to multi-dimensional assignment problems ⋮ A relaxation column signature method for assignment problems ⋮ Scheduling unit processing time jobs on a single machine with multiple criteria ⋮ Adjacency on combinatorial polyhedra ⋮ A review of the use of optimal transport distances for high resolution seismic imaging based on the full waveform ⋮ Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph ⋮ An infeasible (exterior point) simplex algorithm for assignment problems ⋮ The auction algorithm: A distributed relaxation method for the assignment problem ⋮ An efficient labeling technique for solving sparse assignment problems
This page was built for publication: Signature Methods for the Assignment Problem
