Intersection cuts were introduced by Balas and the corner polyhedron by Gomory. It is a classical result that intersection cuts are valid for the corner polyhedron. In this paper we show that, conversely every nontrivial facet-defining inequality for the corner polyhedron is an intersection cut.

Pengohsidan sulfan unSor olelt Thiobacillus denitrificans adalalt dimangl?inlwn o/elt enzim yang didapati df dalam pecahan S 144; GSH dan satu faMor yang stahil terhadap haba adalall diperlulwn untul? tindal?balas. Di dalam peealian 3 144 pengohsidan suifan boleh dilwitl?an hepada pengambilan ohsigen dan di dalam peeahan S 10 pengohsidan dilwithan Iwpada penurwum nitrat. Hasil permulaan pengohs...

We solve a counting problem proposed by Balas and Connor [1] derived from a game called Look Up and Scream. Our solution applies to both variants of the game and is based on counting matchings of every size in the constraints graph of the game. We count such matchings directly in the unconstrained variant of the game and use a counting technique discovered by J. P. McSorley [2] for the constrai...

Edge projection is a specialization of Lovv asz and Plummer's clique projection when restricted to edges. We discuss some properties of the edge projection which are then exploited to develop a new upper bound procedure for the Maximum Cardinality Stable Set Problem (MSS Problem). The upper bound computed by our heuristic, incorporated in a branch-and-bound scheme in conjunction with Balas and ...

Four decades ago, Gomory introduced the corner polyhedron as a relaxation of a mixed integer set in tableau form and Balas introduced intersection cuts for the corner polyhedron. A recent paper of Andersen, Louveaux, Weismantel and Wolsey has generated a renewed interest in the corner polyhedron and intersection cuts. We survey these two approaches and the recent developments in multi-row cuts....

We consider the family of facets of the binary knapsack polytope from minimal covers. We study previous results on sequential lifting in a unifying framework and explore a class of most violated fractional lifted cover inequalities, defined by Balas and Zemel, which are more general than traditional simple lifted cover inequalities. We investigate some theoretical properties of these inequaliti...

This paper presents a branch-and-cut algorithm for the NPhard maximum feasible subsystem problem: For a given infeasible linear inequality system, determine a feasible subsystem containing as many inequalities as possible. The complementary problem, where one has to remove as few inequalities as possible in order to make the system feasible, can be formulated as a set covering problem. The rows...

In the early 1980s, Balas and Jeroslow presented monoidal disjunctive cuts exploiting the integrality of variables. This article investigates the relation of monoidal cut strengthening to other classes of cutting planes for general two-term disjunctions. We introduce a generalization of mixed-integer rounding cuts and show equivalence to monoidal disjunctive cuts. Moreover, we demonstrate the e...

We generalize the disjunctive approach of Balas, Ceria, and Cornuéjols [2] and devevlop a branchand-cut method for solving 0-1 convex programming problems. We show that cuts can be generated by solving a single convex program. We show how to construct regions similar to those of Sherali and Adams [20] and Lovász and Schrijver [12] for the convex case. Finally, we give some preliminary computati...