This newly expanded and updated second edition of the best-selling classic continues to
take the" mystery" out of designing algorithms, and analyzing their efficacy and efficiency …

This survey presents cutting planes that are useful or potentially useful in solving mixed
integer programs. Valid inequalities for (i) general integer programs,(ii) problems with local …

We report on the use of conflict graphs in solving integer programs. A conflict graph
represents logical relations between binary variables. We develop algorithms and data …

A mixed-integer linear program (MILP) is a mathematical program with linear constraints in
which a specified subset of the variables are required to take on integer values. Although …

This paper models the problem of providing an unmanned aerial vehicle (UAV)-based
wireless network in a disaster area as a set covering problem that takes into consideration …

We study a generalization of the vertex packing problem having both binary and bounded
continuous variables, called the mixed vertex packing problem (MVPP). The well-known …

In this paper, we describe a case-study where a Branch-and-Cut algorithm yields the
“optimal” solution of a real-world timetabling problem of University courses (University …

We propose a branch-and-cut algorithm for the Maximum Cardinality Stable Set problem.
Rank constraints of general structure are generated by executing clique separation …

Integer optimization problems are concerned with the efficient allocation of limited resources
to meet a desired objective when some of the resources in question can only be divided into …

This paper presents a branch-and-cut algorithm for the NP-hard maximum feasible
subsystem problem: For a given infeasible linear inequality system, determine a feasible …