216 search results - page 3 / 44 » A hybrid exact algorithm for complete set partitioning |
132
Voted
ISTCS
1997
Springer
15 years 7 months ago
1997
Springer
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
107
Voted
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
140
Voted
CPAIOR
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDST-JSP). The problem consists in scheduling jobs, each job being a set ...
125
Voted
GC
2006
Springer
15 years 3 months ago
2006
Springer
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Pr...
124
Voted
ICCAD
1997
IEEE
15 years 7 months ago
1997
IEEE
We present a new matrix formulation of the face hypercube embedding problem that motivates the design of an efficient search strategy to find an encoding that satisfies all fac...