Sciweavers

14739 search results - page 252 / 2948
» An optimization problem on the sphere
Sort
View
CCCG
2003
15 years 16 days ago
Curves of width one and the river shore problem
We consider the problem of finding the shortest curve in the plane that has unit width. This problem was first posed as the “river shore” puzzle by Ogilvy (1972) and is rela...
Timothy M. Chan, Alexander Golynski, Alejandro L&o...
PDPTA
1996
15 years 14 days ago
Solving a 2D Knapsack Problem on an Associative Computer Augmented with a Linear Network
This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed...
Darrell R. Ulm, Johnnie W. Baker
EOR
2008
79views more  EOR 2008»
14 years 11 months ago
Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a wellknown (and strongly NP-hard) combinatorial optimization problem with many applications. Up to now, the majority of upp...
Konstantinos Kaparis, Adam N. Letchford
MP
2006
101views more  MP 2006»
14 years 11 months ago
Computational complexity of stochastic programming problems
Stochastic programming is the subfield of mathematical programming that considers optimization in the presence of uncertainty. During the last four decades a vast amount of litera...
Martin E. Dyer, Leen Stougie
IPL
2010
74views more  IPL 2010»
14 years 9 months ago
The repeater tree construction problem
A tree-like substructure on a computer chip whose task it is to carry a signal from a source circuit to possibly many sink circuits and which consists only of wires and so-called ...
Christoph Bartoschek, Stephan Held, Jens Maß...