Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
Tuomas Sandholm, Subhash Suri, Andrew Gilpin, Davi...
Backpropagation, similar to most learning algorithms that can form complex decision surfaces, is prone to overfitting. This work presents classification-based objective functions, ...
Attribute reduction of an information system is a key problem in rough set theory and its applications. Using computational intelligence (CI) tools to solve such problems has rece...
This paper is concerned with an employee scheduling problem involving multiple shifts and work centers, where employees belong to a hierarchy of categories having downward substitu...
Abstract. We present a new model for a strategic locomotive scheduling problem arising at the Deutsche Bahn AG. The model is based on a multi-commodity min-cost flow formulation th...