Sciweavers

5506 search results - page 47 / 1102
» Minimal Logic Programs
Sort
View
INFORMS
2007
69views more  INFORMS 2007»
15 years 2 months ago
Dynamic Programming to Minimize the Maximum Number of Open Stacks
Maria Garcia de la Banda, Peter J. Stuckey
ANOR
2011
110views more  ANOR 2011»
14 years 9 months ago
Adaptive memory programming for matrix bandwidth minimization
Vicente Campos, Estefanía Piñana, Ra...
SIAMDM
2010
105views more  SIAMDM 2010»
14 years 9 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...