Results 1  10
of
623,795
Separation algorithms for 01 knapsack polytopes
, 2008
"... Valid inequalities for 01 knapsack polytopes often prove useful when tackling hard 01 Linear Programming problems. To use such inequalities effectively, one needs separation algorithms for them, i.e., routines for detecting when they are violated. We show that the separation problems for the soca ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
inequalities. Finally, we present a new exact separation algorithm for the 01 knapsack polytope itself, which is faster than existing methods. Extensive computational results are also given.
THE SUBMODULAR KNAPSACK POLYTOPE
 FORTHCOMING IN DISCRETE OPTIMIZATION
, 2009
"... The submodular knapsack set is the discrete lower level set of a submodular function. The modular case reduces to the classical linear 01 knapsack set. One motivation for studying the submodular knapsack polytope is to address 01 programming problems with uncertain coefficients. Under various as ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The submodular knapsack set is the discrete lower level set of a submodular function. The modular case reduces to the classical linear 01 knapsack set. One motivation for studying the submodular knapsack polytope is to address 01 programming problems with uncertain coefficients. Under various
Understanding FaultTolerant Distributed Systems
 COMMUNICATIONS OF THE ACM
, 1993
"... We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design ..."
Abstract

Cited by 374 (23 self)
 Add to MetaCart
We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design alternatives, we discuss their relative merits and we give examples of systems which adopt one approach or the other. The aim is to introduce some order in the complex discipline of designing and understanding faulttolerant distributed systems.
RevlexInitial 0/1Polytopes
, 2005
"... We introduce revlexinitial 0/1polytopes as the convex hulls of reverselexicographically initial subsets of 0/1vectors. These polytopes are special knapsackpolytopes. It turns out that they have remarkable extremal properties. In particular, we use these polytopes in order to prove that the mi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We introduce revlexinitial 0/1polytopes as the convex hulls of reverselexicographically initial subsets of 0/1vectors. These polytopes are special knapsackpolytopes. It turns out that they have remarkable extremal properties. In particular, we use these polytopes in order to prove
Hilbert Bases and the Facets of Special Knapsack Polytopes
 Mathematics of Operations Research
, 1994
"... Let a set N of items, a capacity F 2 IN and weights a i 2 IN, i 2 N be given. The 0/1 knapsack polytope is the convex hull of all 0/1 vectors that satisfy the inequality X i2N a i x i F: In this paper we present a linear description of the 0/1 knapsack polytope for the special case where a i 2 f ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
Let a set N of items, a capacity F 2 IN and weights a i 2 IN, i 2 N be given. The 0/1 knapsack polytope is the convex hull of all 0/1 vectors that satisfy the inequality X i2N a i x i F: In this paper we present a linear description of the 0/1 knapsack polytope for the special case where a i 2
On the Expansion of Graphs of 0/1Polytopes
 The Sharpest Cut: The Impact of Manfred Padberg and His Work
, 2001
"... The edge expansion of a graph is the minimum quotient of the number of edges in a cut and the size of the smaller one among the two node sets separated by the cut. Bounding the edge expansion from below is important for bounding the \mixing time" of a random walk on the graph from above. It has ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
. It has been conjectured by Mihail and Vazirani (see [9]) that the graph of every 0/1polytope has edge expansion at least one. A proof of this (or even a weaker) conjecture would imply solutions of several longstanding open problems in the theory of randomized approximate counting. We present dierent
Network Centric Warfare: Developing and Leveraging Information Superiority
 Command and Control Research Program (CCRP), US DoD
, 2000
"... the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technolo ..."
Abstract

Cited by 308 (5 self)
 Add to MetaCart
the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technologies. The CCRP pursues a broad program of research and analysis in information superiority, information operations, command and control theory, and associated operational concepts that enable us to leverage shared awareness to improve the effectiveness and efficiency of assigned missions. An important aspect of the CCRP program is its ability to serve as a bridge between the operational, technical, analytical, and educational communities. The CCRP provides leadership for the command and control research community by: n n
On Facets of Knapsack Equality Polytopes
, 1997
"... The 0/1 knapsack equality polytope is, by definition, the convex hull of 0/1 solutions of a single linear equation. A special form of this polytope  where the defining linear equation has nonnegative integer coefficients and the number of variables having coefficient one exceeds the righthandsid ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The 0/1 knapsack equality polytope is, by definition, the convex hull of 0/1 solutions of a single linear equation. A special form of this polytope  where the defining linear equation has nonnegative integer coefficients and the number of variables having coefficient one exceeds the right
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 6 (1 self)
 Add to MetaCart
inequalities. We show that unlike 0–1 knapsack polytopes, in which different facetdefining inequalities can be derived by fixing variables at 0 or 1, and then sequentially lifting cover inequalities valid for the projected polytope, any sequentially lifted cover inequality for the complementarity knapsack
Corn Yields and Profitability for LowCapacity Irrigation Systems
 Applied Engineering in Agriculture. 2001. 17(3): 316
"... ABSTRACT. In many areas of the central U.S. Great Plains irrigation well capacities are decreasing due to declines in the Ogallala aquifer. Many producers using furrow surface irrigation are faced with a decision on whether they should convert to a higher efficiency center pivot sprinkler irrigation ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
irrigation system with 70 % application efficiency produced simulated crop yields of 12.3, 12.2, 12.1, and 11.3 Mg/ha, respectively, when irrigation capacity was 6.35 mm/day. Reducing the irrigation capacity to 2.54 mm/day reduced yields to 9.4, 9.2, 8.9, and 8.3 Mg/ha for the respective irrigation systems
Results 1  10
of
623,795