Pages that link to "Item:Q3392067"
From MaRDI portal
The following pages link to Lexicographically Minimum and Maximum Load Linear Programming Problems (Q3392067):
Displaying 14 items.
- Inequity averse optimization in operational research (Q319581) (← links)
- Linear programming models for load balancing (Q810365) (← links)
- The balanced linear programming problem (Q1278929) (← links)
- Exact lexicographic scheduling and approximate rescheduling (Q2029366) (← links)
- Planning sustainable routes: economic, environmental and welfare concerns (Q2140143) (← links)
- Balanced flows for transshipment problems (Q2235277) (← links)
- A lexicographic minimax approach to the vehicle routing problem with route balancing (Q2282498) (← links)
- An iterated min-max procedure for practical workload balancing on non-identical parallel machines in manufacturing systems (Q2312337) (← links)
- Editorial. Fair optimization and networks: models, algorithms, and applications (Q2336349) (← links)
- Fair optimization and networks: a survey (Q2336590) (← links)
- Max-min fairness in multi-commodity flows (Q2384908) (← links)
- Proportional and maxmin fairness for the sensor location problem with chance constraints (Q2414477) (← links)
- Portioning using ordinal preferences: fairness and efficiency (Q2680774) (← links)
- A lexicographic maximin approach to the selective assessment routing problem (Q6103191) (← links)