Pages that link to "Item:Q3706837"
From MaRDI portal
The following pages link to Signature Methods for the Assignment Problem (Q3706837):
Displayed 38 items.
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- Efficient index reduction algorithm for large scale systems of differential algebraic equations (Q671058) (← links)
- A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
- Signature classes of transportation polytopes (Q689115) (← links)
- Polynomial dual network simplex algorithms (Q689130) (← links)
- An infeasible (exterior point) simplex algorithm for assignment problems (Q811357) (← links)
- Sparse dual transportation polyhedra: Extreme points and signatures (Q911458) (← links)
- Worst case examples of an exterior point algorithm for the assignment problem (Q937404) (← links)
- Perfect matchings and extended polymatroid (Q946789) (← links)
- An efficient labeling technique for solving sparse assignment problems (Q1071650) (← links)
- Improving the Hungarian assignment algorithm (Q1085073) (← links)
- A shortest augmenting path algorithm for dense and sparse linear assignment problems (Q1085784) (← links)
- A sequential dual simplex algorithm for the linear assignment problem (Q1108928) (← links)
- Personnel placement in a fuzzy environment (Q1185999) (← links)
- Polynomial-time primal simplex algorithms for the minimum cost network flow problem (Q1193519) (← links)
- The auction algorithm: A distributed relaxation method for the assignment problem (Q1320412) (← links)
- Max-min matching problems with multiple assignments (Q1359459) (← links)
- A new algorithm for the assignment problem: An alternative to the Hungarian method (Q1374026) (← links)
- Critical objective function values in linear sum assignment problems (Q1743488) (← links)
- A strongly polynomial algorithm for the transportation problem (Q1804365) (← links)
- A relaxation column signature method for assignment problems (Q1814258) (← links)
- Scheduling unit processing time jobs on a single machine with multiple criteria (Q1823849) (← links)
- Adjacency on combinatorial polyhedra (Q1842660) (← links)
- The singly constrained assignment problem: An AP basis algorithm (Q1908532) (← links)
- Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
- A novel convex dual approach to three-dimensional assignment problem: theoretical analysis (Q2007830) (← links)
- A dual approach to multi-dimensional assignment problems (Q2052387) (← links)
- A review of the use of optimal transport distances for high resolution seismic imaging based on the full waveform (Q2094840) (← links)
- Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search (Q2230729) (← links)
- Assignment problems with changeover cost (Q2267319) (← links)
- Efficient dual simplex algorithms for the assignment problem (Q3701192) (← links)
- A competitive (dual) simplex method for the assignment problem (Q3730345) (← links)
- Transportation problems which can be solved by the use of hirsch-paths for the dual problems (Q3783840) (← links)
- Perfectly matchable subgraph problem on a bipartite graph (Q5189879) (← links)
- A graph space optimal transport distance as a generalization of <i>L</i> <sup> <i>p</i> </sup> distances: application to a seis (Q5228010) (← links)
- Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph (Q5870844) (← links)
- Polarity-free automatic classification of chromosomes. (Q5940797) (← links)
- A faster data assignment algorithm for maximum likelihood-based multitarget motion tracking with bearings-only measurements (Q5944024) (← links)