You have Guest access.
Log In
Volume 1 / 1997 - Volume 23 / 2012
127-146
Designing k -coverage schedules in wireless sensor networks
Yingshu Li and Shan Gao
147-164
Column generation approach for the point-feature cartographic label placement problem
Glaydston Mattos Ribeiro and Luiz Antonio Nogueira Lorena
165-178
Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
Yannick Vimont, Sylvain Boussier and Michel Vasquez
179-190
An exponential (matching based) neighborhood for the vehicle routing problem
Eric Angel, Evripidis Bampis and Fanny Pascual
191-199
On lazy bureaucrat scheduling with common deadlines
Ling Gai and Guochuan Zhang
201-221
On the inapproximability of the exemplar conserved interval distance problem of genomes
Zhixiang Chen, Richard H. Fowler, Bin Fu and Binhai Zhu
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info