The following pages link to (Q5615775):
Displaying 13 items.
- Optimum matchings in weighted bipartite graphs (Q265439) (← links)
- Parallel-machine scheduling with maintenance: praising the assignment problem (Q322837) (← links)
- Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph (Q492279) (← links)
- A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
- Maximum weight bipartite matching in matrix multiplication time (Q1035683) (← links)
- An algorithm for algebraic assignment problems (Q1138479) (← links)
- The auction algorithm: A distributed relaxation method for the assignment problem (Q1320412) (← links)
- A statistical correlation technique and a neural network for the motion correspondence problem (Q1323580) (← links)
- Critical objective function values in linear sum assignment problems (Q1743488) (← links)
- An equivalency problem in discrete programming over ordered semigroups (Q1843494) (← links)
- Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
- Jacobi's bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages (Q6166083) (← links)
- Minimum jointly structural input and output selection (Q6566753) (← links)