Pages that link to "Item:Q1306468"
From MaRDI portal
The following pages link to Lexicographic bottleneck combinatorial problems (Q1306468):
Displaying 11 items.
- Computation of equilibria and the price of anarchy in bottleneck congestion games (Q301322) (← links)
- Assignment problems: a golden anniversary survey (Q852938) (← links)
- Bottleneck partial-matching Voronoi diagrams and applications (Q902422) (← links)
- On \(k\)-Max-optimization (Q1002079) (← links)
- Lexicographic balanced optimization problems (Q1433654) (← links)
- Solving some lexicographic multi-objective combinatorial problems (Q1598728) (← links)
- The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases (Q1755782) (← links)
- The dominance assignment problem (Q1926493) (← links)
- On the hierarchical Chinese postman problem with linear ordered classes (Q2569095) (← links)
- A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks (Q2664012) (← links)
- A class of bottleneck expansion problems (Q5936134) (← links)
