Robust auction design under multiple priors by linear and integer programming.

Çagil Koçyigit Halil I. Bayrak Mustafa Ç. Pinar

Published in: Ann. Oper. Res. (2018)

Keyphrases

integer programming
layout design
lagrangian relaxation
linear programming
network flow
production planning
constraint programming
network design
ai planning
cutting plane
facility location
np hard
column generation
online auctions
set covering
set covering problem
cutting plane algorithm