We study a new class of decentralized algorithms for discrete optimization via simulation, which is inspired by the fictitious play algorithm applied to games with identical inte...
We consider a scenario in which a single Red wishes to shoot at a collection of Blue targets, one at a time, to maximise some measure of return obtained from Blues killed before R...
Kevin D. Glazebrook, Christopher Kirkbride, H. M. ...
We study an inventory system under periodic review in the presence of two suppliers (or delivery modes). The emergency supplier has a shorter lead-time than the regular supplier, ...
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
We analyze a general market for an industry of competing service facilities. Firms differentiate themselves by their price levels and the waiting time their customers experience,...