Sciweavers

5331 search results - page 149 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
CPAIOR
2006
Springer
15 years 1 months ago
The Timetable Constrained Distance Minimization Problem
We define the timetable constrained distance minimization problem (TCDMP) which is a sports scheduling problem applicable for tournaments where the total travel distance must be mi...
Rasmus V. Rasmussen, Michael A. Trick
ANOR
2006
59views more  ANOR 2006»
14 years 10 months ago
The empirical behavior of sampling methods for stochastic programming
Abstract. We investigate the quality of solutions obtained from sample-average approximations to two-stage stochastic linear programs with recourse. We use a recently developed sof...
Jeff Linderoth, Alexander Shapiro, Stephen Wright
CORR
2011
Springer
173views Education» more  CORR 2011»
14 years 5 months ago
Exploiting symmetries in SDP-relaxations for polynomial optimization
Abstract. We consider the issue of exploiting symmetries in the hierarchy of semidefinite programming relaxations recently introduced in polynomial optimization. We focus on probl...
Cordian Riener, Thorsten Theobald, Lina Jansson An...
ISCC
2006
IEEE
154views Communications» more  ISCC 2006»
15 years 4 months ago
Decentralized Load Balancing for Highly Irregular Search Problems
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
Giuseppe Di Fatta, Michael R. Berthold
COCOON
2001
Springer
15 years 2 months ago
Packing Two Disks into a Polygonal Environment
: We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are conta...
Prosenjit Bose, Pat Morin, Antoine Vigneron