Sciweavers

4843 search results - page 612 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
IPL
2008
89views more  IPL 2008»
15 years 4 months ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik
COR
2007
106views more  COR 2007»
15 years 4 months ago
Scheduling parallel CNC machines with time/cost trade-off considerations
When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance.A well-known example for such a cas...
Sinan Gurel, M. Selim Akturk
JIFS
2006
120views more  JIFS 2006»
15 years 4 months ago
Building similarity metrics reflecting utility in case-based reasoning
Fundamental to case-based reasoning is the idea that similar problems have similar solutions. The meaning of the concept of "similarity" can vary in different situations...
Ning Xiong, Peter Funk
111
Voted
EOR
2007
76views more  EOR 2007»
15 years 4 months ago
Multicriteria tour planning for mobile healthcare facilities in a developing country
A multiobjective combinatorial optimization (MOCO) formulation for the following location-routing problem in healthcare management is given: For a mobile healthcare facility, a cl...
Karl Doerner, Axel Focke, Walter J. Gutjahr
IPL
2007
96views more  IPL 2007»
15 years 4 months ago
On constructing an optimal consensus clustering from multiple clusterings
Computing a suitable measure of consensus among several clusterings on the same data is an important problem that arises in several areas such as computational biology and data mi...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao, Jie...