Sciweavers

1707 search results - page 191 / 342
» Early Integer Programming
Sort
View
65
Voted
FMSD
2007
97views more  FMSD 2007»
14 years 10 months ago
On the optimal reachability problem of weighted timed automata
We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infi...
Patricia Bouyer, Thomas Brihaye, Véronique ...
MP
2006
78views more  MP 2006»
14 years 10 months ago
Valid inequalities based on the interpolation procedure
We study the interpolation procedure of Gomory and Johnson (1972), which generates cutting planes for general integer programs from facets of cyclic group polyhedra. This idea has...
Sanjeeb Dash, Oktay Günlük
MP
2006
79views more  MP 2006»
14 years 10 months ago
Projection results for vehicle routing
A variety of integer programming formulations have been proposed for Vehicle Routing Problems (VRPs), including the so-called two- and three-index formulations, the set partitioni...
Adam N. Letchford, Juan José Salazar Gonz&a...
82
Voted
SIAMJO
2008
97views more  SIAMJO 2008»
14 years 10 months ago
New Formulations for Optimization under Stochastic Dominance Constraints
Stochastic dominance constraints allow a decision-maker to manage risk in an optimization setting by requiring their decision to yield a random outcome which stochastically domina...
James Luedtke
86
Voted
SIGARCH
2008
94views more  SIGARCH 2008»
14 years 10 months ago
Optimized on-chip pipelining of memory-intensive computations on the cell BE
Multiprocessors-on-chip, such as the Cell BE processor, regularly suffer from restricted bandwidth to off-chip main memory. We propose to reduce memory bandwidth requirements, and...
Christoph W. Kessler, Jörg Keller