Pages that link to "Item:Q1260736"
From MaRDI portal
The following pages link to An algorithm for the bottleneck generalized assignment problem (Q1260736):
Displaying 16 items.
- An iterative algorithm for two level hierarchical time minimization transportation problem (Q319851) (← links)
- Bilevel time minimizing assignment problem (Q865542) (← links)
- A note on exact algorithms for the bottleneck generalized assignment problem (Q1388862) (← links)
- A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem (Q1652389) (← links)
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches (Q1908034) (← links)
- Multivariate composite distributions for coefficients in synthetic optimization problems (Q1969891) (← links)
- An iterative solution technique for capacitated two-stage time minimization transportation problem (Q2095523) (← links)
- An alternate approach to solve two-level priority based assignment problem (Q2114824) (← links)
- Fair task allocation problem (Q2288963) (← links)
- A priority based assignment problem (Q2293428) (← links)
- A polynomial algorithm for a two-stage time minimizing transportation problem. (Q2467864) (← links)
- Max-min sum minimization transportation problem (Q2507394) (← links)
- CAPACITATED TWO-STAGE TIME MINIMIZATION TRANSPORTATION PROBLEM (Q3052717) (← links)
- On lexicographic optimal solutions in transportation problems (Q4340165) (← links)
- A priority based time minimization transportation problem (Q4987785) (← links)
- A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)