Journal of Combinatorial Optimization
Full-text
Availability: Mar 1997 to Present
Number of Articles: N/A
Publishers: Springer
Peer Reviewed: Yes
Data Format: XML,DialogB
Mark this title to add it to your saved items and then contact us to inquire about licensing
Contact the Gale Group for more information
Contact UsBy Angel, Eric
(February 2008)
Byline: Eric Angel (1), Evripidis Bampis (1), Fanny Pascual (1)
Keywords:
Local search; Exponential neighborhood; Vehicle routing problem; Matching
Abstract:
We introduce an exponential neighborhood for the Vehicle Routing Problem (vrp) with unit customers' demands, and we show that it can be explored efficiently in polynomial time by reducing its exploration to a particular case of the Restricted Complete Matching (rcm) problem that we prove to be...
By Li, Yingshu
(February 2008)
Byline: Yingshu Li (1), Shan Gao (1)
Keywords:
Wireless sensor networks; k-coverage; Sensing range; Network management
Abstract:
Some sensor network applications require k-coverage to ensure the quality of surveillance. Meanwhile, energy is another primary concern for sensor networks. In this paper, we investigate the Sensor Scheduling for k-Coverage (SSC) problem which requires to efficiently schedule the sensors, such that the monitored area can be...
By Vimont, Yannick
(February 2008)
Byline: Yannick Vimont (1), Sylvain Boussier (1), Michel Vasquez (1)
Keywords:
Multidimensional knapsack problem; Implicit enumeration; Variable fixing; Reduced costs; Constraint propagation
Abstract:
In a previous work we proposed a variable fixing heuristics for the 0-1 Multidimensional knapsack problem (01MDK). This approach uses fractional optima calculated in hyperplanes which contain the binary optimum. This algorithm obtained best lower bounds on...
