Sciweavers

16404 search results - page 529 / 3281
» A set coverage problem
Sort
View
4OR
2008
115views more  4OR 2008»
15 years 5 months ago
A branch-and-price algorithm for the two-dimensional level strip packing problem
The two-dimensional level strip packing problem (2LSPP) consists in packing rectangular items of given size into a strip of given width divided into levels. Items packed into the ...
Andrea Bettinelli, Alberto Ceselli, Giovanni Righi...
JACM
2010
116views more  JACM 2010»
15 years 5 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára
NETWORKS
2010
15 years 5 months ago
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
In the Traveling Salesman Problem with Pickup and Delivery (TSPPD) a single vehicle must serve a set of customer requests, each defined by an origin location where a load must be...
Jean-François Cordeau, Manuel Iori, Gilbert...
COGSR
2011
71views more  COGSR 2011»
15 years 1 months ago
Psychological models of human and optimal performance in bandit problems
In bandit problems, a decision-maker must choose between a set of alternatives, each of which has a fixed but unknown rate of reward, to maximize their total number of rewards ov...
Michael D. Lee, Shunan Zhang, Miles Munro, Mark St...
195
Voted
SIAMNUM
2011
110views more  SIAMNUM 2011»
15 years 1 months ago
A Posteriori Error Control for Discontinuous Galerkin Methods for Parabolic Problems
We derive energy-norm a posteriori error bounds for an Euler timestepping method combined with various spatial discontinuous Galerkin schemes for linear parabolic problems. For acc...
Emmanuil H. Georgoulis, Omar Lakkis, Juha M. Virta...