A New Family of Valid-Inequalities for Dantzig-Wolfe Reformulation Mixed Integer Linear Programs In “Consistency Cuts Reformulation,” Jens Vinther Clausen, Richard Lusby, and Stefan Ropke present a new family valid inequalities to be applied reformulations with binary linking variables. They show that, mixed integer linear programs that satisfy certain properties, it is enough solve the program...

We compare the performance of 3 approaches to the solution of MAX-SAT problems, including a version of the DavisPutnam-Loveland algorithm extended to solve MAX-SAT, an integer programming branch-and-cut algorithm and an algorithm for MAX-2-SAT problems based on a semide nite programming relation.

Mixed integer Gomory cuts have become an integral part of state-of-the-art software for solving mixed integer linear programming problems. Therefore, improvements in the performance of these cutting planes can be of great practical value. In this paper we present a simple and fast heuristic for improving the coefficients on the continuous variables in the mixed integer Gomory cuts. This is moti...

We extend the theoretical foundations of the branch-and-cut method using lift-and-project cuts for a broader class of disjunctive constraints , and also present a new, substantially improved disjunctive cut generator. Employed together with an eecient commercial MIP solver, our code is a robust, general purpose method for solving mixed integer programs. We present extensive computational experi...

Abstract We study linear bilevel programming problems, where (some of) the leader and follower variables are restricted to be integer. A discussion on relationships between optimistic pessimistic setting is presented, providing necessary sufficient conditions for them equivalent. new class of inequalities, optimality cuts, introduced. They used derive a single-level non-compact reformulation pr...

The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. We solve a strong integer linear programming formulation based on so-called jump inequalities by a Branch&Cut algorithm. As the separation subproblem of identifying currently violated jump inequalities is difficult, we...

In this paper, we address the combined assortment and trim loss minimization problem. In real settings, when different stock lengths are available, a common problem is to select a subset of stock lengths from which to cut the ordered items. In the cutting and packing literature, this problem is known as the assortment problem. Solving the assortment and trim loss minimization problem in a singl...

The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. The problem consists of determining a minimum cost tour such that each pickup vertex is visited before its corresponding delivery vertex. In this paper, the TSPPD is modeled as an integer linear program and its polyhed...