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 …

This paper considers an integrated service network design problem for a given set of freight
demands that is concerned with integration of locating cross-docking (CD) centers and …

We study the polyhedra of splittable and unsplittable single arc–set relaxations of
multicommodity flow capacitated network design problems. We investigate the optimization …

We present a branch-and-cut algorithm to solve capacitated network design problems.
Given a capacitated network and point-to-point traffic demands, the objective is to install …

This book arose from a realization that modeling using mathematical programming should
be tightly linked with algorithms and their software implementation to solve optimization …

We study the mixed–integer knapsack polyhedron, that is, the convex hull of the mixed–
integer set defined by an arbitrary linear inequality and the bounds on the variables. We …

In this article, we study capacitated network design problems. We unify and extend
polyhedral results for directed, bidirected, and undirected link capacity models. Valid …

In the context of combined road–rail freight transport, we study the integrated tactical
planning of hub locations and the design of a frequency service network. We consider a …

We investigate the use of cutting planes for integer programs with general integer variables.
We show how cutting planes arising from knapsack inequalities can be generated and lifted …

We consider network design and routing for Internet Protocol (IP) traffic. The design problem
concerns capacity dimensioning of communication links, where the design cost consists of …