Sciweavers

1725 search results - page 191 / 345
» Relaxed genetic programming
Sort
View
ESOP
2010
Springer
15 years 1 months ago
A Semantic Framework for Declassification and Endorsement
Language-based information flow methods offer a principled way to enforce strong security properties, but enforcing noninterference is too inflexible for realistic applications. Se...
Aslan Askarov, Andrew Myers
EOR
2007
69views more  EOR 2007»
14 years 10 months ago
Incorporating inventory and routing costs in strategic location models
We consider a supply chain design problem where the decision maker needs to decide the number and locations of the distribution centers (DCs). Customers face random demand, and ea...
Zuo-Jun Max Shen, Lian Qi
CORR
2010
Springer
159views Education» more  CORR 2010»
14 years 7 months ago
On optimizing over lift-and-project closures
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
Pierre Bonami
MP
2010
92views more  MP 2010»
14 years 5 months ago
Single item lot-sizing with non-decreasing capacities
We consider the single item lot-sizing problem with capacities that are non-decreasing over time. When the cost function is i) non-speculative or Wagner-Whitin (for instance, cons...
Yves Pochet, Laurence A. Wolsey
ICCS
2007
Springer
15 years 4 months ago
Using Computer Simulation to Understand Mutation Accumulation Dynamics and Genetic Load
Long-standing theoretical concerns about mutation accumulation within the human population can now be addressed with numerical simulation. We apply a biologically realistic forward...
John Sanford, John Baumgardner, Wes Brewer, Paul G...