Sciweavers

2976 search results - page 313 / 596
» On the bounded integer programming
Sort
View
CORR
2008
Springer
132views Education» more  CORR 2008»
15 years 4 months ago
Building Better Nurse Scheduling Algorithms
The aim of this research is twofold: Firstly, to model and solve a complex nurse scheduling problem with an integer programming formulation and evolutionary algorithms. Secondly, ...
Uwe Aickelin, Paul White
DAM
2008
88views more  DAM 2008»
15 years 4 months ago
On the asymmetric representatives formulation for the vertex coloring problem
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
Manoel B. Campêlo, Victor A. Campos, Ricardo...
ENDM
2010
136views more  ENDM 2010»
15 years 4 months ago
Approximating the asymmetric profitable tour
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
Viet Hung Nguyen, Thi Thu Thuy Nguyen
IJSNET
2008
125views more  IJSNET 2008»
15 years 4 months ago
Minimum-cost sensor arrangement for achieving wanted coverage lifetime
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...
Jie Wang, Ning Zhong
JNW
2006
98views more  JNW 2006»
15 years 4 months ago
Efficient Distributed Algorithm for RWA Using Path Protection
A number of Integer Linear Program (ILP) formulations for both static and dynamic lightpath allocation have been proposed, for the design of survivable WDM networks. However, such ...
Arunita Jaekel, Ying Chen