Results 1  10
of
126
FACETS OF THE COMPLEMENTARITY KNAPSACK POLYTOPE
, 2002
"... We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additional constraints, and the model is tightened by introducing strong inequalities valid for the resulting MIP. We use an alt ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additional constraints, and the model is tightened by introducing strong inequalities valid for the resulting MIP. We use
CONCISE COMMUNICATIONS
, 1992
"... The complete envelopeglycoprotein H (gH) coding sequences of 10 clinicalstrains of cytomegalovirus (CMV) were determined and compared with those of laboratory strains AD169 and Towne. Their translated peptide sequences segregated into two groups, exemplified by AD169 and Towne. Peptide variation wa ..."
Abstract
 Add to MetaCart
of up to four groupspecific peptide configurations at these loci [4, 5]. gH (gp86) was initially characterized by sequencing and reactivity with a neutralizing murine monoclonal antibody [6]. In its glycosylated form, it has a size of 86 kDa and appears to bind a 92.5kDa cellular receptor [7
A Polyhedral Study of the Cardinality Constrained Knapsack Problem
, 2001
"... A cardinality constrained knapsack problem is a continuous knapsack problem in which no more than a specified number of nonnegative variables are allowed to be positive. This structure occurs, for example, in areas such as finance, location, and scheduling. Traditionally, cardinality constraints are ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
A cardinality constrained knapsack problem is a continuous knapsack problem in which no more than a specified number of nonnegative variables are allowed to be positive. This structure occurs, for example, in areas such as finance, location, and scheduling. Traditionally, cardinality constraints
Dynamic Knapsack Sets And Capacitated LotSizing
, 2000
"... A dynamic knapsack set is a natural generalization of the 01 knapsack set with a continuous variable studied recently. For dynamic knapsack sets a large family of facetdefining inequalities, called dynamic knapsack inequalities, are derived by fixing variables to one and then lifting. Surprisingly ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
A dynamic knapsack set is a natural generalization of the 01 knapsack set with a continuous variable studied recently. For dynamic knapsack sets a large family of facetdefining inequalities, called dynamic knapsack inequalities, are derived by fixing variables to one and then lifting
Lifting valid inequalities for the precedence constrained knapsack problem
, 1997
"... This paper considers the precedence constrained knapsack problem. More specically, we are interested in classes of valid inequalities which are facetdefining for the precedence constrained knapsack polytope. We study the complexity of obtaining these facets using the standard sequential lifting pro ..."
Abstract
 Add to MetaCart
. We also consider Kcovers, to which the same procedure need not apply in general. We show that facets of the polytope can still be generated using a similar lifting technique. For tree knapsack problems, we observe that all lifting coecients can be obtained in polynomial time. Computational
Generating facets for the independence system polytope
, 2009
"... In this paper, we present procedures to obtain facetdefining inequalities for the independence system polytope. These procedures are defined for inequalities which are not necessarily rank inequalities. We illustrate the use of these procedures by deriving strong valid inequalities for the acyclic ..."
Abstract
 Add to MetaCart
induced subgraph, triangle free induced subgraph, bipartite induced subgraph, and knapsack polytopes. Finally, we derive a new family of facetdefining inequalities for the independence system polytope by adding a set of edges to antiwebs.
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
, 2005
"... We consider a stochastic variant of the NPhard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary distributions. Items are placed in the knapsack sequentially, and the act of placing an item in the knapsack instantiates ..."
Abstract
 Add to MetaCart
on the instantiated sizes of items placed in the knapsack thus far). An important facet of our work lies in characterizing the benefit of adaptivity. For this purpose we advocate the use of a measure called the adaptivity gap: the ratio of the expected value obtained by an optimal adaptive policy to that obtained
Downgrading policies and relaxed noninterference
 SIGPLAN Not
, 2005
"... In traditional informationflow type systems, the security policy is often formalized as noninterference properties. However, noninterference alone is too strong to express security properties useful in practice. If we allow downgrading in such systems, it is challenging to formalize the security po ..."
Abstract

Cited by 97 (12 self)
 Add to MetaCart
policy as an extensional property of the system. This paper presents a generalized framework of downgrading policies. Such policies can be specified in a simple and tractable language and can be statically enforced by mechanisms such as type systems. The security guarantee is then formalized as a concise
Valid inequalities and facets of the capacitated plant location problem
 Mathematical Programming
, 1989
"... Recently, several successful applications of strong cutting plane methods to combinatorial optimization problems have renewed interest in cutting plane methods, and polyhedral characterizations, of integer programming problems. In this paper, we investigate the polyhedral structure of the capacitate ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
Recently, several successful applications of strong cutting plane methods to combinatorial optimization problems have renewed interest in cutting plane methods, and polyhedral characterizations, of integer programming problems. In this paper, we investigate the polyhedral structure
On nstep MIR and Partition Inequalities for Integer Knapsack and Singlenode Capacitated Flow Sets
"... Pochet and Wolsey [Y. Pochet, L.A. Wolsey, Integer knapsack and flow covers with divisible coefficients: polyhedra, optimization and separation. Discrete Applied Mathematics 59(1995) 57–74] introduced partition inequalities for three substructures arising in various mixed integer programs, namely th ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
, and underscore the power of nstep MIR to easily generate strong valid inequalities. Key words: nstep mixed integer rounding, partition inequality, integer knapsack set, capacitated flow set, valid inequality, facet
Results 1  10
of
126