Pages that link to "Item:Q4302861"
From MaRDI portal
The following pages link to A parallel shortest augmenting path algorithm for the assignment problem (Q4302861):
Displaying 23 items.
- Efficient index reduction algorithm for large scale systems of differential algebraic equations (Q671058) (← links)
- Towards auction algorithms for large dense assignment problems (Q839685) (← links)
- Solution of large dense transportation problems using a parallel primal algorithm (Q922946) (← links)
- A shortest augmenting path algorithm for dense and sparse linear assignment problems (Q1085784) (← links)
- A note on exploiting the Hamiltonian cycle problem substructure of the asymmetric traveling salesman problem (Q1178723) (← links)
- A note on an orthogonal systolic design for the assignment problem (Q1179253) (← links)
- A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems (Q1194853) (← links)
- Lower bounds for nonlinear assignment problems using many body interactions (Q1291723) (← links)
- Parallel primal-dual methods for the minimum cost flow problem (Q1315451) (← links)
- Implementing (nondeterministic) parallel assignments (Q1352008) (← links)
- Massively parallel augmenting path algorithms for the assignment problem (Q1365535) (← links)
- A comparison of two algorithms for the assignment problem (Q1804373) (← links)
- A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem (Q1814992) (← links)
- Scheduling unit processing time jobs on a single machine with multiple criteria (Q1823849) (← links)
- A comment on ``A simple sequencing algorithm for mixed-model assembly lines in just-in-time production systems'' (Q1890955) (← links)
- Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
- Minimizing variation of production rates in just-in-time systems: A survey (Q2367376) (← links)
- A distributed exact algorithm for the multiple resource constrained sequencing problem (Q2368093) (← links)
- A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem (Q3991331) (← links)
- Index Matrices as a Cost Optimization Tool of Resource Provisioning in Uncertain Cloud Computing Environment (Q5051125) (← links)
- A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique (Q5131697) (← links)
- Analysis and solution to the single-level batch production smoothing problem (Q5438683) (← links)
- Bicriteria sequencing methods for the mixed-model assembly line in just-in-time production systems (Q5937358) (← links)
