Sciweavers

4843 search results - page 82 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
SIAMJO
2002
102views more  SIAMJO 2002»
14 years 9 months ago
Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
We consider a conic-quadratic (and in particular a quadratically constrained) optimization problem with uncertain data, known only to reside in some uncertainty set U. The robust ...
Aharon Ben-Tal, Arkadi Nemirovski, Cees Roos
COR
2006
82views more  COR 2006»
14 years 10 months ago
Semidefinite programming based approaches to the break minimization problem
This paper considers the break minimization problem in sports timetabling. The problem is to find, under a given timetable of a round-robin tournament, a home-away assignment that...
Ryuhei Miyashiro, Tomomi Matsui
IPL
2008
95views more  IPL 2008»
14 years 10 months ago
The Generalized Maximum Coverage Problem
We define a new problem called the Generalized Maximum Coverage Problem (GMC). GMC is an extension of the Budgeted Maximum Coverage Problem, and it has important applications in w...
Reuven Cohen, Liran Katzir
CCCG
2008
14 years 11 months ago
The Embroidery Problem
We consider the problem of embroidering a design pattern, given by a graph G, using a single minimum length thread. We give an exact polynomial-time algorithm for the case that G ...
Esther M. Arkin, George Hart, Joondong Kim, Irina ...
IPL
2007
94views more  IPL 2007»
14 years 10 months ago
The finite horizon investor problem with a budget constraint
We study a model that incorporates a budget constraint in a decision making problem. Our goal is to maximize the expected wealth, where in each time period we can either stop the ...
Asaf Levin