1. Designing k-coverage schedules in wireless sensor networks

   • Yingshu Li
   • Shan Gao

   OriginalPaper 21 March 2007 Pages: 127 - 146

2. Column generation approach for the point-feature cartographic label placement problem

   • Glaydston Mattos Ribeiro
   • Luiz Antonio Nogueira Lorena

   OriginalPaper 21 March 2007 Pages: 147 - 164

3. Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem

   • Yannick Vimont
   • Sylvain Boussier
   • Michel Vasquez

   OriginalPaper 21 April 2007 Pages: 165 - 178

4. An exponential (matching based) neighborhood for the vehicle routing problem

   • Eric Angel
   • Evripidis Bampis
   • Fanny Pascual

   OriginalPaper 06 June 2007 Pages: 179 - 190

5. On lazy bureaucrat scheduling with common deadlines

   • Ling Gai
   • Guochuan Zhang

   OriginalPaper 11 May 2007 Pages: 191 - 199

6. On the inapproximability of the exemplar conserved interval distance problem of genomes

   • Zhixiang Chen
   • Richard H. Fowler
   • Binhai Zhu

   OriginalPaper 30 May 2007 Pages: 201 - 221