Sciweavers

4266 search results - page 77 / 854
» The container loading problem
Sort
View
COR
2010
152views more  COR 2010»
13 years 10 months ago
Variable neighborhood search for the dial-a-ride problem
In dial-a-ride problems passengers have to be transported between pre-specified pickup and delivery locations under user inconvenience considerations. The problem variant consider...
Sophie N. Parragh, Karl F. Doerner, Richard F. Har...
ICASSP
2011
IEEE
13 years 1 months ago
Analysis of unknown velocity and target off the grid problems in compressive sensing based subsurface imaging
Sparsity of target space in subsurface imaging problem is used within the framework of the compressive sensing (CS) theory in recent publications to decrease the data acquisition ...
Mehmet Ali Çagri Tuncer, Ali Cafer Gurbuz
MFCS
2005
Springer
14 years 3 months ago
Tight Approximability Results for the Maximum Solution Equation Problem over Zp
In the maximum solution equation problem a collection of equations are given over some algebraic structure. The objective is to find an assignment to the variables in the equation...
Fredrik Kuivinen
IPCO
2004
114views Optimization» more  IPCO 2004»
13 years 11 months ago
Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
CORR
2006
Springer
91views Education» more  CORR 2006»
13 years 10 months ago
Improved results for a memory allocation problem
We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. T...
Leah Epstein, Rob van Stee