Pages that link to "Item:Q1229812"
From MaRDI portal
The following pages link to On the bottleneck assignment problem (Q1229812):
Displaying 18 items.
- Assignment problems: a golden anniversary survey (Q852938) (← links)
- Bilevel time minimizing assignment problem (Q865542) (← links)
- A generalized bottleneck assignment problem (Q1148787) (← links)
- On the bottleneck linear programming problem (Q1161448) (← links)
- A variant of time minimizing assignment problem (Q1303581) (← links)
- A variation of the assignment problem (Q1309926) (← links)
- The three-dimensional bottleneck assignment problem with capacity constraints (Q1328651) (← links)
- Max-min matching problems with multiple assignments (Q1359459) (← links)
- Tabu search and iterated local search for the cyclic bottleneck assignment problem (Q1652664) (← links)
- Bottleneck assignment problems under categorization (Q1821678) (← links)
- An alternate approach to solve two-level priority based assignment problem (Q2114824) (← links)
- A priority based assignment problem (Q2293428) (← links)
- A priority based unbalanced time minimization assignment problem (Q2307977) (← links)
- Competitive strategies for an online generalized assignment problem with a service consecution constraint (Q2355803) (← links)
- An improved algorithm for two stage time minimization assignment problem (Q2420663) (← links)
- A lexi-search algorithm for a time minimizing assignment problem. (Q2468579) (← links)
- The three dimensional bottleneck assignment problem and its variants (Q3690581) (← links)
- Time–cost trade-off in a multi-choice assignment problem (Q6094492) (← links)
