Combinatorial optimization problems appear in many disciplines ranging from management
and logistics to mathematics, physics, and chemistry. These problems are usually relatively …

The polyhedral approach is one of the most powerful techniques available for solving hard
combinatorial optimization problems. The main idea behind the technique is to consider the …

We present a framework for automatic tightening of general 0-1 programs. A givenconstraint
is tightened by using its own structure as well as information from the other constraints. Our …

An O (n log n) procedure is presented for obtaining facets of the knapsack polytope by lifting
the inequalities induced by the extensions of strong minimal covers. The procedure does not …

The polyhedral approach is one of the most powerful techniques available for solving hard
combinatorial optimization problems. The main idea behind the technique is to consider the …

We present two procedures for tightening cover induced inequalities in 0-1 programs by
using knapsack constraints plus some other information from the program. The tightening is …

This chapter provides motivation for studying mixed complementarity problems in energy.
This class of problems has proven to be especially important in modeling the various …

The propositional satisfiability problem (SAT) is a fundamental problem in computer science
and combinatorial optimization. A considerable number of prior researchers have …