Sciweavers

1026 search results - page 181 / 206
» On Finding Minimal w-cutset
Sort
View
EOR
2007
69views more  EOR 2007»
13 years 9 months ago
Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts
— We describe a solution procedure for a special case of the periodic vehicle routing problem (PVRP). Operation managers at an auto parts in the north of Spain described the opti...
Jesús F. Alegre, Manuel Laguna, Joaqu&iacut...
MOR
2006
81views more  MOR 2006»
13 years 9 months ago
Simulated Annealing for Convex Optimization
We apply the method known as simulated annealing to the following problem in convex optimization: minimize a linear function over an arbitrary convex set, where the convex set is ...
Adam Tauman Kalai, Santosh Vempala
SIAMJO
2008
175views more  SIAMJO 2008»
13 years 9 months ago
On Bin Packing with Conflicts
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
Leah Epstein, Asaf Levin
SIAMSC
2008
139views more  SIAMSC 2008»
13 years 9 months ago
Probing the Pareto Frontier for Basis Pursuit Solutions
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
Ewout van den Berg, Michael P. Friedlander
SAC
2006
ACM
13 years 9 months ago
A new method of generating synchronizable test sequences that detect output-shifting faults based on multiple UIO sequences
The objective of testing is to determine the conformance between a system and its specification. When testing distributed systems, the existence of multiple testers brings out the...
Kai Chen, Fan Jiang, Chuan-dong Huang