Sciweavers

3433 search results - page 143 / 687
» Heuristics for a bidding problem
Sort
View
BMCBI
2006
100views more  BMCBI 2006»
15 years 6 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong
EOR
2008
82views more  EOR 2008»
15 years 6 months ago
Solving the pallet loading problem
This paper presents new bounds, heuristics, and an exact algorithm for the Pallet Loading Problem (PLP). PLP maximizes the number of boxes placed on a rectangular pallet. All boxe...
Gustavo H. A. Martins, Robert F. Dell
COR
2006
62views more  COR 2006»
15 years 6 months ago
Solving the Multidimensional Multiple-choice Knapsack Problem by constructing convex hulls
This paper presents a heuristic to solve the Multidimensional Multiple-choice Knapsack Problem (MMKP), a variant of the classical 0
Md. Mostofa Akbar, Mohammad Sohel Rahman, Mohammad...
HEURISTICS
2010
15 years 1 months ago
An evolutionary and constructive approach to a crew scheduling problem in underground passenger transport
Operation management of underground passenger transport systems is associated with combinatorial optimization problems (known as crew and train scheduling and rostering) which bel...
Rafael Elizondo, Víctor Parada, Lorena Prad...
ICDT
2005
ACM
128views Database» more  ICDT 2005»
16 years 1 days ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...