Pages that link to "Item:Q3991331"
From MaRDI portal
The following pages link to A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem (Q3991331):
Displaying 18 items.
- Assignment problems: a golden anniversary survey (Q852938) (← links)
- Bicriterion scheduling with equal processing times on a batch processing machine (Q947947) (← links)
- The multi-period incremental service facility location problem (Q960382) (← links)
- A shortest augmenting path algorithm for dense and sparse linear assignment problems (Q1085784) (← links)
- An O(\(n\)) bound for the diameter of transshipment polytopes (Q1195869) (← links)
- The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm (Q1318275) (← links)
- A note on the assignment problem with seniority and job priority constraints. (Q1420440) (← links)
- Linear assignment procedures (Q1610146) (← links)
- A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem (Q1814992) (← links)
- Solving the \(k\)-cardinality assignment problem by transformation (Q1877052) (← links)
- The singly constrained assignment problem: An AP basis algorithm (Q1908532) (← links)
- Variational approximation of interface energies and applications (Q2042376) (← links)
- Linear and semi-assignment problems: A core oriented approach (Q2563894) (← links)
- Threshold assignment algorithm (Q3743115) (← links)
- A parallel shortest augmenting path algorithm for the assignment problem (Q4302861) (← links)
- Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem (Q4385161) (← links)
- Exact Algorithms for Distributionally <i>β</i>-Robust Machine Scheduling with Uncertain Processing Times (Q5137951) (← links)
- FPT algorithms for a special block-structured integer program with applications in scheduling (Q6634532) (← links)
