18 search results - page 2 / 4 » cpaior 2005 |
122
Voted
CPAIOR
2005
Springer
15 years 10 months ago
2005
Springer
Creating good integer programming formulations had, as a basic axiom, the rule “Find formulations with tighter linear relaxations”. This rule, while useful when using unsophist...
160
Voted
CPAIOR
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. This paper introduces a problem called the temporal knapsack problem, presents several algorithms for solving it, and compares their performance. The temporal knapsack pr...
136
Voted
CPAIOR
2005
Springer
15 years 10 months ago
2005
Springer
A cardinality constraint imposes that each value of a set V must be taken a certain number of times by a set of variables X, whereas an among constraint imposes that a certain numb...
151
Voted
CPAIOR
2005
Springer
15 years 10 months ago
2005
Springer
The scheduling of social golfers has attracted significant attention in recent years because of its highly symmetrical and combinatorial nature. In particular, it has become one o...
165
click to vote
CPAIOR
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We present an algorithmic framework for integrating solution methods that is based on search, inference, and relaxation and their interactions. We show that the following...