Sciweavers

2061 search results - page 9 / 413
» The continuous knapsack set
Sort
View
MP
2002
48views more  MP 2002»
14 years 9 months ago
Maximum stable set formulations and heuristics based on continuous optimization
The stability number (G) for a given graph G is the size of a maximum stable set in G. The Lov
Samuel Burer, Renato D. C. Monteiro, Yin Zhang
CORR
2008
Springer
78views Education» more  CORR 2008»
14 years 9 months ago
On the Continuity Set of an omega Rational Function
Olivier Carton, Olivier Finkel, Pierre Simonnet
AUSSOIS
2001
Springer
15 years 2 months ago
Exact Algorithms for NP-Hard Problems: A Survey
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open prob...
Gerhard J. Woeginger
70
Voted
ISAAC
1992
Springer
132views Algorithms» more  ISAAC 1992»
15 years 1 months ago
Generalized Assignment Problems
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...
Silvano Martello, Paolo Toth