Pages that link to "Item:Q1821678"
From MaRDI portal
The following pages link to Bottleneck assignment problems under categorization (Q1821678):
Displaying 17 items.
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- Assignment problems: a golden anniversary survey (Q852938) (← links)
- Bilevel time minimizing assignment problem (Q865542) (← links)
- Group centre and group median of a network (Q1123113) (← links)
- Minmax combinatorial optimization (Q1130081) (← links)
- Traveling salesman problem under categorization (Q1200771) (← links)
- Minimum perfect bipartite matchings and spanning trees under categorization (Q1201102) (← links)
- A variant of time minimizing assignment problem (Q1303581) (← links)
- On bottleneck assignment problems under categorization. (Q1422389) (← links)
- Multiple bottleneck assignment problem (Q1806893) (← links)
- Categorized bottleneck-minisum path problems on networks (Q1890954) (← links)
- A priority based unbalanced time minimization assignment problem (Q2307977) (← 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)
- Task preference-based bottleneck assignment problem (Q2675766) (← links)
- Generalized Bottleneck Problems<sup>∗</sup> (Q4859828) (← links)
- BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM (Q5038210) (← links)
