Sciweavers

2 search results - page 1 / 1
» Continuous knapsack sets with divisible capacities
Sort
View
MP
2008
99views more  MP 2008»
13 years 10 months ago
Compact formulations as a union of polyhedra
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhed...
Michele Conforti, Laurence A. Wolsey
PERCOM
2011
ACM
13 years 2 months ago
Mobile node rostering in intermittently connected passive RFID networks
— This paper focuses on the problem of rostering in intermittently connected passive RFID networks. It aims to report a list of tagged mobile nodes that appear in given intereste...
Zhipeng Yang, Hongyi Wu