Pages that link to "Item:Q1306359"
From MaRDI portal
The following pages link to An improved general procedure for lexicographic bottleneck problems (Q1306359):
Displayed 13 items.
- Computation of equilibria and the price of anarchy in bottleneck congestion games (Q301322) (← links)
- On discrete optimization with ordering (Q367635) (← links)
- Generalized multiple objective bottleneck problems (Q453049) (← links)
- Conjoint axiomatization of Min, DiscriMin and LexiMin (Q703385) (← links)
- A preference-based approach to spanning trees and shortest paths problems (Q704097) (← links)
- Bottleneck partial-matching Voronoi diagrams and applications (Q902422) (← links)
- On \(k\)-Max-optimization (Q1002079) (← links)
- Lexicographic balanced optimization problems (Q1433654) (← links)
- Revisiting \(k\)-sum optimization (Q1675256) (← links)
- Ordered weighted average optimization in multiobjective spanning tree problem (Q1753508) (← links)
- The dominance assignment problem (Q1926493) (← links)
- Computer science and decision theory (Q2271874) (← links)
- Fair optimization and networks: a survey (Q2336590) (← links)