42 search results - page 8 / 9 » Cover and Pack Inequalities for (Mixed) Integer Programming |
IPCO
2007
13 years 9 months ago
2007
We study the Master Equality Polyhedron (MEP) which generalizes the Master Cyclic Group Polyhedron and the Master Knapsack Polyhedron. We present an explicit characterization of t...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
AUTOMATICA
1999
13 years 7 months ago
1999
This paper proposes a framework for modeling and controlling systems described by interdependent physical laws, logic rules, and operating constraints, denoted as mixed logical dy...
COCOA
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
CPAIOR
2009
Springer
14 years 2 months ago
2009
Springer
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...