A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation.
Haris AzizHervé MoulinFedor SandomirskiyPublished in: CoRR (2019)
Keyphrases
- computational complexity
- learning algorithm
- pareto optimal
- optimization algorithm
- worst case
- k means
- dynamic programming
- search space
- optimal solution
- cost function
- np hard
- genetic programming
- computationally efficient
- computational efficiency
- objective function
- neural network
- particle swarm optimization
- test problems
- allocation strategy