Sciweavers

2976 search results - page 5 / 596
» On the bounded integer programming
Sort
View
CORR
2006
Springer
105views Education» more  CORR 2006»
13 years 7 months ago
Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II: A Simple Example
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of t...
Joel Friedman
CPAIOR
2007
Springer
14 years 1 months ago
Best-First AND/OR Search for 0/1 Integer Programming
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
Radu Marinescu 0002, Rina Dechter
CORR
2011
Springer
215views Education» more  CORR 2011»
12 years 11 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
MP
2007
95views more  MP 2007»
13 years 7 months ago
Smoothed analysis of integer programming
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
Heiko Röglin, Berthold Vöcking
4OR
2006
99views more  4OR 2006»
13 years 7 months ago
A decomposition-based solution method for stochastic mixed integer nonlinear programs
This is a summary of the main results presented in the author's PhD thesis, supervised by D. Conforti and P. Beraldi and defended on March 2005. The thesis, written in English...
Maria Elena Bruni