Sciweavers

925 search results - page 24 / 185
» A Solution to the Extended GCD Problem
Sort
View
AAAI
2000
13 years 9 months ago
Solving a Supply Chain Optimization Problem Collaboratively
We propose a novel algorithmic framework to solve an integrated planning and scheduling problem in supply chain management. This problem involves the integration of an inventory m...
Hoong Chuin Lau, Andrew Lim, Qi Zhang Liu
ISAAC
2007
Springer
146views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Bounded Tree-Width and CSP-Related Problems
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
Tommy Färnqvist, Peter Jonsson
STOC
1998
ACM
139views Algorithms» more  STOC 1998»
13 years 12 months ago
Approximation Schemes for Euclidean k-Medians and Related Problems
In the k-median problem we are given a set S of n points in a metric space and a positive integer k. We desire to locate k medians in space, such that the sum of the distances fro...
Sanjeev Arora, Prabhakar Raghavan, Satish Rao
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
13 years 9 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
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 7 months ago
Enhanced Direct and Indirect Genetic Algorithm Approaches for a Mall Layout and Tenant Selection Problem
During our earlier research, it was recognised that in order to be successful with an indirect genetic algorithm approach using a decoder, the decoder has to strike a balance betw...
Uwe Aickelin, Kathryn A. Dowsland