Sciweavers

14548 search results - page 50 / 2910
» The Optimal Path-Matching Problem
Sort
View
ANOR
2011
117views more  ANOR 2011»
13 years 1 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
IOR
2010
112views more  IOR 2010»
13 years 8 months ago
New Policies for the Stochastic Inventory Control Problem with Two Supply Sources
We study an inventory system under periodic review in the presence of two suppliers (or delivery modes). The emergency supplier has a shorter lead-time than the regular supplier, ...
Anshul Sheopuri, Ganesh Janakiraman, Sridhar Sesha...
TNN
2010
171views Management» more  TNN 2010»
13 years 4 months ago
Sensitivity versus accuracy in multiclass problems using memetic Pareto evolutionary neural networks
This paper proposes a multiclassification algorithm using multilayer perceptron neural network models. It tries to boost two conflicting main objectives of multiclassifiers: a high...
Juan Carlos Fernández Caballero, Francisco ...
MP
2010
132views more  MP 2010»
13 years 4 months ago
Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the b...
Etienne de Klerk, Renata Sotirov
KES
2010
Springer
13 years 8 months ago
Solving real-world vehicle routing problems with time windows using virus evolution strategy
This paper proposes a new solution to the vehicle routing problem with time windows using an evolution strategy adopting viral infection. The problem belongs to the NP-hard class a...
Hitoshi Kanoh, Souichi Tsukahara