Sciweavers

2743 search results - page 461 / 549
» Minimization of an M-convex Function
Sort
View
MP
2006
175views more  MP 2006»
13 years 9 months ago
Conditional Value-at-Risk in Stochastic Programs with Mixed-Integer Recourse
In classical two-stage stochastic programming the expected value of the total costs is minimized. Recently, mean-risk models - studied in mathematical finance for several decades -...
Rüdiger Schultz, Stephan Tiedemann
ANOR
2005
94views more  ANOR 2005»
13 years 9 months ago
Cover and Pack Inequalities for (Mixed) Integer Programming
We review strong inequalities for fundamental knapsack relaxations of (mixed) integer programs. These relaxations are the 0-1 knapsack set, the mixed 0-1 knapsack set, the integer ...
Alper Atamtürk
TIT
2008
110views more  TIT 2008»
13 years 9 months ago
Optimal Cross-Layer Scheduling of Transmissions Over a Fading Multiaccess Channel
We consider the problem of several users transmitting packets to a base station, and study an optimal scheduling formulation involving three communication layers, namely, the mediu...
Munish Goyal, Anurag Kumar, Vinod Sharma
BMCBI
2005
77views more  BMCBI 2005»
13 years 9 months ago
The Gene Set Builder: collation, curation, and distribution of sets of genes
Background: In bioinformatics and genomics, there are many applications designed to investigate the common properties for a set of genes. Often, these multi-gene analysis tools at...
Dimas Yusuf, Jonathan S. Lim, Wyeth W. Wasserman
JCO
2007
100views more  JCO 2007»
13 years 9 months ago
Semi-online scheduling with "end of sequence" information
We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing ...
Leah Epstein, Deshi Ye