Designing k-coverage schedules in wireless sensor networks Yingshu LiShan Gao OriginalPaper 21 March 2007 Pages: 127 - 146
Column generation approach for the point-feature cartographic label placement problem Glaydston Mattos RibeiroLuiz Antonio Nogueira Lorena OriginalPaper 21 March 2007 Pages: 147 - 164
Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem Yannick VimontSylvain BoussierMichel Vasquez OriginalPaper 21 April 2007 Pages: 165 - 178
An exponential (matching based) neighborhood for the vehicle routing problem Eric AngelEvripidis BampisFanny Pascual OriginalPaper 06 June 2007 Pages: 179 - 190
On lazy bureaucrat scheduling with common deadlines Ling GaiGuochuan Zhang OriginalPaper 11 May 2007 Pages: 191 - 199
On the inapproximability of the exemplar conserved interval distance problem of genomes Zhixiang ChenRichard H. FowlerBinhai Zhu OriginalPaper 30 May 2007 Pages: 201 - 221
