Pages that link to "Item:Q1914072"
From MaRDI portal
The following pages link to An efficient cost scaling algorithm for the assignment problem (Q1914072):
Displaying 19 items.
- Optimum matchings in weighted bipartite graphs (Q265439) (← links)
- A framework for edge detection based on relief functions (Q506701) (← links)
- A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals (Q552189) (← links)
- Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment (Q709154) (← links)
- Towards auction algorithms for large dense assignment problems (Q839685) (← links)
- Linear assignment procedures (Q1610146) (← links)
- Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
- The assignment problem revisited (Q2136890) (← links)
- Classes of linear programs solvable by coordinate-wise minimization (Q2163850) (← links)
- Multiscale edge detection using first-order derivative of anisotropic Gaussian kernels (Q2331084) (← links)
- The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies (Q2356207) (← links)
- Solving the rectangular assignment problem and applications (Q2430614) (← links)
- Reducing rank-maximal to maximum weight matching (Q2465632) (← links)
- Expected time complexity of the auction algorithm and the push relabel algorithm for maximum bipartite matching on random graphs (Q2795749) (← links)
- Exact solution of emerging quadratic assignment problems (Q3002542) (← links)
- Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order (Q5505660) (← links)
- Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates (Q6066663) (← links)
- On the role of distance transformations in Baddeley's delta metric (Q6092027) (← links)
- Coarse graining of multiple water molecules with intelligent dissipative particle dynamics (Q6669801) (← links)
