Signature Methods for the Assignment Problem
From MaRDI portal
Recommendations
- A relaxation column signature method for assignment problems
- The signature method for some classes of transportation problem
- scientific article; zbMATH DE number 894763
- Un nuevo algoritmo en programacion signomial
- A simple approach towards the sign problem using path optimisation
- A non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem
- scientific article; zbMATH DE number 4001850
- On the algorithm of the solution of the Signorini problem
Cited in
(42)- An efficient labeling technique for solving sparse assignment problems
- Improving the Hungarian assignment algorithm
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- A sequential dual simplex algorithm for the linear assignment problem
- Personnel placement in a fuzzy environment
- Polynomial-time primal simplex algorithms for the minimum cost network flow problem
- Solving linear bottleneck assignment problems via strong spanning trees
- The auction algorithm: A distributed relaxation method for the assignment problem
- Max-min matching problems with multiple assignments
- A new algorithm for the assignment problem: An alternative to the Hungarian method
- Critical objective function values in linear sum assignment problems
- A strongly polynomial algorithm for the transportation problem
- A relaxation column signature method for assignment problems
- Scheduling unit processing time jobs on a single machine with multiple criteria
- Adjacency on combinatorial polyhedra
- The singly constrained assignment problem: An AP basis algorithm
- Algorithms and codes for dense assignment problems: The state of the art
- A novel convex dual approach to three-dimensional assignment problem: theoretical analysis
- A dual approach to multi-dimensional assignment problems
- A review of the use of optimal transport distances for high resolution seismic imaging based on the full waveform
- Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search
- Assignment problems with changeover cost
- Efficient dual simplex algorithms for the assignment problem
- A competitive (dual) simplex method for the assignment problem
- Transportation problems which can be solved by the use of hirsch-paths for the dual problems
- A non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem
- scientific article; zbMATH DE number 894763 (Why is no real title available?)
- Exterior point simplex-type algorithms for linear and network optimization problems
- Perfectly matchable subgraph problem on a bipartite graph
- A graph space optimal transport distance as a generalization of L p distances: application to a seis
- Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph
- Polarity-free automatic classification of chromosomes.
- A faster data assignment algorithm for maximum likelihood-based multitarget motion tracking with bearings-only measurements
- Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
- Efficient index reduction algorithm for large scale systems of differential algebraic equations
- A genuinely polynomial primal simplex algorithm for the assignment problem
- Signature classes of transportation polytopes
- Polynomial dual network simplex algorithms
- An infeasible (exterior point) simplex algorithm for assignment problems
- Sparse dual transportation polyhedra: Extreme points and signatures
- Worst case examples of an exterior point algorithm for the assignment problem
- Perfect matchings and extended polymatroid
This page was built for publication: Signature Methods for the Assignment Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3706837)
