1254 search results - page 30 / 251 » Making Hard Problems Harder |
COR
2011
13 years 2 months ago
2011
In this paper we make a comparative study of several mixed integer linear programming (MILP) formulations for resource-constrained project scheduling problems (RCPSPs). First, we ...
INFOSCALE
2007
ACM
13 years 9 months ago
2007
ACM
Problem localization is a critical part of providing crucial system management capabilities to modern distributed environments. One key open challenge is for problem localization ...
ANOR
2007
13 years 7 months ago
2007
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
AUSAI
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present a Lagrangian-based heuristic LAHA for the Winner Determination Problem in Combinatorial Auctions. The algorithm makes use of the market computing power by appl...
JDA
2008
13 years 7 months ago
2008
Set Cover problems are of core importance in many applications. In recent research, the "red-blue variants" where blue elements all need to be covered whereas red elemen...