Sciweavers

16596 search results - page 398 / 3320
» Generalized Assignment Problems
Sort
View
219
Voted
FOCM
2011
188views more  FOCM 2011»
14 years 11 months ago
Compressive Wave Computation
This paper considers large-scale simulations of wave propagation phenomena. We argue that it is possible to accurately compute a wavefield by decomposing it onto a largely incomp...
Laurent Demanet, Gabriel Peyré
EOR
2010
81views more  EOR 2010»
15 years 7 months ago
Dynamic pickup and delivery problems
In the last decade, there has been an increasing body of research in dynamic vehicle routing problems. This article surveys the subclass of those problems called dynamic pickup an...
Gerardo Berbeglia, Jean-François Cordeau, G...
IPL
2008
135views more  IPL 2008»
15 years 7 months ago
On the Positive-Negative Partial Set Cover problem
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
Pauli Miettinen
EUSFLAT
2001
103views Fuzzy Logic» more  EUSFLAT 2001»
15 years 9 months ago
Possible optimality of solutions in a single machine scheduling problem with fuzzy parameters
A single machine scheduling problem with parameters given in the form of fuzzy numbers is considered. It is assumed that the optimal schedule in such a problem cannot be determine...
Stefan Chanas, Adam Kasperski
CORR
2008
Springer
150views Education» more  CORR 2008»
15 years 7 months ago
A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
Mugurel Ionut Andreica