Sciweavers

COR
2006
112views more  COR 2006»
13 years 11 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
73views more  COR 2006»
13 years 11 months ago
Locating repair shops in a stochastic environment
Jan-Kees C. W. van Ommeren, Adriana Felicia Bumb, ...
COR
2006
67views more  COR 2006»
13 years 11 months ago
The capacitated centred clustering problem
Marcos Negreiros, Augusto Palhano
COR
2006
82views more  COR 2006»
13 years 11 months ago
Semidefinite programming based approaches to the break minimization problem
This paper considers the break minimization problem in sports timetabling. The problem is to find, under a given timetable of a round-robin tournament, a home-away assignment that...
Ryuhei Miyashiro, Tomomi Matsui
COR
2006
91views more  COR 2006»
13 years 11 months ago
An LP approach to compute the pre-kernel for cooperative games
We present an algorithm to compute the (pre)-kernel of a TU-game N, v with a system of n 2 1 linear programming problems. In contrast to the algorithms using convergence methods t...
Holger Meinhardt
COR
2006
84views more  COR 2006»
13 years 11 months ago
Stability and interaction in flatline games
Starting from a given one-shot game played by a finite population of agents living in flatline, a circular or constrained grid structured by the classical definitions of neighborh...
Alexander Mehlmann
COR
2006
118views more  COR 2006»
13 years 11 months ago
Simulated annealing heuristics for the dynamic facility layout problem
In today's economy, manufacturing plants must be able to operate efficiently and respond quickly to changes in product mix and demand. Therefore, this paper considers the pro...
Alan R. McKendall Jr., Jin Shang, Saravanan Kuppus...
COR
2006
93views more  COR 2006»
13 years 11 months ago
Solving capacitated arc routing problems using a transformation to the CVRP
A well known transformation by Pearn, Assad and Golden reduces a Capacitated Arc Routing Problem (CARP) into an equivalent Capacitated Vehicle Routing Problem (CVRP). However, tha...
Humberto Longo, Marcus Poggi de Aragão, Edu...
COR
2006
65views more  COR 2006»
13 years 11 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
129views more  COR 2006»
13 years 11 months ago
Game-theoretic analysis of an ancient Chinese horse race problem
This paper analyzes a legendary Chinese horse race problem involving the King of Qi and General Tianji which took place more than 2000 years ago. In this problem each player owns ...
Mingming Leng, Mahmut Parlar