High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming.
Robert BredereckAndrzej KaczmarczykDusan KnopRolf NiedermeierPublished in: EC (2019)
Keyphrases
- integer programming
- high multiplicity
- scheduling problem
- np hard
- asymptotically optimal
- single machine
- linear programming
- envy free
- processing times
- cutting plane
- production planning
- network flow
- constraint programming
- ai planning
- column generation
- lagrangian relaxation
- job shop scheduling problem
- resource allocation
- valid inequalities
- set covering problem
- combinatorial auctions
- cutting plane algorithm
- neural network
- integer program
- np complete
- optimal solution
- flowshop
- vehicle routing problem with time windows
- special case