Sciweavers

1984 search results - page 76 / 397
» The colourful feasibility problem
Sort
View
COR
2006
122views more  COR 2006»
13 years 10 months ago
Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Problems
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
Fernando C. Gomes, Cláudio Nogueira de Mene...
EOR
2007
78views more  EOR 2007»
13 years 10 months ago
A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem
Video on Demand (VoD) is a technology used to provide a number of programs to a number of users on request. In developing a VoD system, a fundamental problem is load balancing, wh...
Tolga Bektas, Osman Oguz, Iradj Ouveysi
4OR
2008
115views more  4OR 2008»
13 years 8 months ago
A branch-and-price algorithm for the two-dimensional level strip packing problem
The two-dimensional level strip packing problem (2LSPP) consists in packing rectangular items of given size into a strip of given width divided into levels. Items packed into the ...
Andrea Bettinelli, Alberto Ceselli, Giovanni Righi...
NA
2010
82views more  NA 2010»
13 years 8 months ago
Semi-definite programming techniques for structured quadratic inverse eigenvalue problems
In the past decade or so, semi-definite programming (SDP) has emerged as a powerful tool capable of handling a remarkably wide range of problems. This article describes an innovat...
Matthew M. Lin, Bo Dong, Moody T. Chu
HICSS
2005
IEEE
157views Biometrics» more  HICSS 2005»
14 years 3 months ago
A Two-Stage Heuristic for the Vehicle Routing Problem with Time Windows and a Limited Number of Vehicles
The Vehicle Routing Problem with Time Windows (VRPTW) is an important problem in logistics. The problem is to serve a number of customers at minimum cost without violating the cus...
Andrew Lim, Xingwen Zhang