Sciweavers

12753 search results - page 2497 / 2551
» is 2002
Sort
View
MP
2002
143views more  MP 2002»
13 years 8 months ago
Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
François Vanderbeck
MP
2002
176views more  MP 2002»
13 years 8 months ago
UOBYQA: unconstrained optimization by quadratic approximation
UOBYQA is a new algorithm for general unconstrained optimization calculations, that takes account of the curvature of the objective function, F say, by forming quadratic models by ...
M. J. D. Powell
MP
2002
85views more  MP 2002»
13 years 8 months ago
From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
Dimitris Bertsimas, Jay Sethuraman
MP
2002
195views more  MP 2002»
13 years 8 months ago
Nonlinear rescaling vs. smoothing technique in convex optimization
We introduce an alternative to the smoothing technique approach for constrained optimization. As it turns out for any given smoothing function there exists a modification with part...
Roman A. Polyak
MR
2002
82views Robotics» more  MR 2002»
13 years 8 months ago
Failure modes of tantalum capacitors made by different technologies
Generally, tantalum capacitor failure modes have been discussed both for the standard manganese dioxide cathode and the new conductive polymer (CP) type. For standard tantalum in ...
Petr Vasina, T. Zednicek, Josef Sikula, Jan Pavelk...
« Prev « First page 2497 / 2551 Last » Next »