Sciweavers

1725 search results - page 14 / 345
» Relaxed genetic programming
Sort
View
IOR
2010
83views more  IOR 2010»
13 years 4 months ago
Information Relaxations and Duality in Stochastic Dynamic Programs
David B. Brown, James E. Smith, Peng Sun
SIAMDM
2010
105views more  SIAMDM 2010»
13 years 2 months ago
Minimal Inequalities for an Infinite Relaxation of Integer Programs
We show that maximal S-free convex sets are polyhedra when S is the set of integral points in some rational polyhedron of Rn . This result extends a theorem of Lov
Amitabh Basu, Michele Conforti, Gérard Corn...