Sciweavers

1984 search results - page 54 / 397
» The colourful feasibility problem
Sort
View
EVOW
2007
Springer
16 years 26 days ago
A Hybrid Method for Solving Large-Scale Supply Chain Problems
Abstract. The strategic supply chain design problem which allows capacity shifts and budget limitations can be formulated as a linear program. Since facilities are allowed to be op...
Steffen Wolf, Peter Merz
IDA
2005
Springer
16 years 6 days ago
Miner Ants Colony: A New Approach to Solve a Mine Planning Problem
In this paper we introduce a simple ant based algorithm for solving a copper mine planning problem. In the last 10 years this realworld problem has been tackled using linear intege...
María-Cristina Riff, Michael Moossen, Xavie...
IWANN
2001
Springer
15 years 11 months ago
A Comparison of Several Evolutionary Heuristics for the Frequency Assignment Problem
Abstract. The Frequency Assignment Problem (FAP) is a very important problem of practical interest. This work compares several evolutionary approaches to this problem, based both i...
Carlos Cotta, José M. Troya
FSTTCS
1991
Springer
15 years 10 months ago
Randomizing Reductions of Search Problems
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
Andreas Blass, Yuri Gurevich
JOIN
2007
133views more  JOIN 2007»
15 years 6 months ago
The Coverage Problem in Three-Dimensional Wireless Sensor Networks
— One of the fundamental issues in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formul...
Chi-Fu Huang, Yu-Chee Tseng, Li-Chu Lo