Lexicographically Minimum and Maximum Load Linear Programming Problems
From MaRDI portal
Publication:3392067
Recommendations
Cited in
(15)- The balanced linear programming problem
- Exact lexicographic scheduling and approximate rescheduling
- Planning sustainable routes: economic, environmental and welfare concerns
- Balanced flows for transshipment problems
- A lexicographic minimax approach to the vehicle routing problem with route balancing
- An iterated min-max procedure for practical workload balancing on non-identical parallel machines in manufacturing systems
- Editorial. Fair optimization and networks: models, algorithms, and applications
- Fair optimization and networks: a survey
- Max-min fairness in multi-commodity flows
- Proportional and maxmin fairness for the sensor location problem with chance constraints
- Portioning using ordinal preferences: fairness and efficiency
- Inequity averse optimization in operational research
- A lexicographic maximin approach to the selective assessment routing problem
- Resource sharing revisited: local weak duality and optimal convergence
- Linear programming models for load balancing
This page was built for publication: Lexicographically Minimum and Maximum Load Linear Programming Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392067)