Pages that link to "Item:Q1196169"

The following pages link to A lexicographic minimax algorithm for multiperiod resource allocation (Q1196169):

Displaying 13 items.

• On the lexicographic centre of multiple objective optimization (Q274101) (← links)
• Soft time-windows for a bi-objective vendor selection problem under a multi-sourcing strategy: binary-continuous differential evolution (Q342547) (← links)
• An equitable bandwidth allocation model for video-on-demand networks (Q1035732) (← links)
• Multiperiod allocation of substitutable resources (Q1127148) (← links)
• On the lexicographic minimax approach to location problems (Q1278138) (← links)
• Relaxation-based algorithms for minimax optimization problems with resource allocation applications (Q1332312) (← links)
• Bounded knapsack sharing (Q1804651) (← links)
• A game-theoretic optimisation approach to fair customer allocation in oligopolies (Q2218902) (← links)
• Balanced flows for transshipment problems (Q2235277) (← links)
• Fair optimization and networks: a survey (Q2336590) (← links)
• A multicriteria facility location model for municipal solid waste management in North Greece (Q2467292) (← links)
• Equitable bandwidth allocation in content distribution networks (Q3553745) (← links)
• An algorithm for linearly-constrained piecewise lexicographic programming problems. (Q5958084) (← links)