158 search results - page 11 / 32 » Solving Sequential Mixed Auctions with Integer Programming |
INFORMS
2006
13 years 7 months ago
2006
This paper intends to show that the time needed to solve mixed integer programming problems by branch and bound can be roughly predicted early in the solution process. We construc...
IJMTM
2011
13 years 2 months ago
2011
: In this paper, we address a lot splitting and scheduling problem existent in a textile factory. The factory we study produces a set of products that are made of, or assembled fro...
AAAI
1998
13 years 9 months ago
1998
Production planning is an important task in manufacturing systems. We consider a real-world capacitated lot-sizing problem (CLSP) from the process industry. Because the problem re...
JAIR
2010
13 years 6 months ago
2010
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature su...
ICRA
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— We study multi-robot routing problems (MRLDR) where a team of robots has to visit a set of given targets with linear decreasing rewards over time, such as required for ...