2061 search results - page 30 / 413 » The continuous knapsack set |
WSC
1998
14 years 11 months ago
1998
Heuristics are an increasingly popular solution method for combinatorial optimization problems. Heuristic use often frees the modeler from some of the restrictions placed on class...
DISOPT
2008
14 years 9 months ago
2008
We introduce a general technique to create an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set ...
80
Voted
CN
2006
14 years 9 months ago
2006
Energy saving is a paramount concern in wireless sensor networks (WSNs). A strategy for energy saving is to cleverly manage the duty cycle of sensors, by dynamically activating di...
COR
2007
14 years 9 months ago
2007
This paper considers the design of two-layered fully interconnected networks.A two-layered network consists of clusters of nodes, each defining an access network and a backbone n...
JCT
2006
14 years 9 months ago
2006
We introduce revlex-initial 0/1-polytopes as the convex hulls of reverse-lexicographically initial sets of 0/1-vectors. Thus for each n 2d , we consider the 0/1-knapsack polytope ...