Sciweavers

2244 search results - page 22 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
COR
2007
163views more  COR 2007»
14 years 9 months ago
A general heuristic for vehicle routing problems
We present a unified heuristic, which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacit...
David Pisinger, Stefan Ropke
ICTAC
2009
Springer
15 years 2 months ago
A Formal Approach to Heuristically Test Restorable Systems
Abstract. Given a nite state machine denoting the specication of a system, nding some short interaction sequences capable to reach some/all states or transitions of this machine...
Pablo Rabanal, Ismael Rodríguez, Fernando R...
SAC
2004
ACM
15 years 2 months ago
An improved hybrid genetic algorithm for the generalized assignment problem
We consider the generalized assignment problem in which the objective is to find a minimum cost assignment of a set of jobs to a set of agents subject to resource constraints. Th...
Harald Feltl, Günther R. Raidl
JAIR
2008
121views more  JAIR 2008»
14 years 9 months ago
A Constraint Programming Approach for Solving a Queueing Control Problem
In a facility with front room and back room operations, it is useful to switch workers between the rooms in order to cope with changing customer demand. Assuming stochastic custom...
Daria Terekhov, J. Christopher Beck
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
14 years 10 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan