Sciweavers

93 search results - page 9 / 19
» cor 2006
Sort
View
COR
2006
65views more  COR 2006»
14 years 10 months ago
An exact method for graph coloring
We are interested in the graph coloring problem. We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to...
Corinne Lucet, Florence Mendes, Aziz Moukrim
COR
2006
112views more  COR 2006»
14 years 10 months ago
A continuous approach to considering uncertainty in facility design
This paper presents a formulation of the facilities block layout problem which explicitly considers uncertainty in material handling costs on a continuous scale by use of expected...
Bryan A. Norman, Alice E. Smith
COR
2006
88views more  COR 2006»
14 years 10 months ago
An exact algorithm for the capacitated vertex p-center problem
We develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients7 to them within capacity restrictions in order to minimize the max...
F. Aykut Özsoy, Mustafa Ç. Pinar
COR
2006
94views more  COR 2006»
14 years 10 months ago
A comparison of two different formulations for arc routing problems on mixed graphs
Arc Routing Problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing ...
Angel Corberán, Enrique Mota, José M...
COR
2006
95views more  COR 2006»
14 years 10 months ago
Generating optimal two-section cutting patterns for rectangular blanks
This paper presents an algorithm for generating unconstrained guillotine-cutting patterns for rectangular blanks. A pattern includes at most two sections, each of which consists o...
Yaodong Cui, Dongli He, Xiaoxia Song