It is well known that choosing a good formulation for a mixed-integer optimization model can drastically reduce its solution time with a linear-programming based branch-and-bound algorithm. Integer optimization software such as CPLEX and XPRESS-MP has progressed rapidly in recent years and implements powerful branchand-cut algorithms, combining branch-and-bound with cutting plane generation. In...

Branch and cut methods for integer programming problems solve a sequence of linear programming problems. Traditionally, these linear programming relaxations have been solved using the simplex method. The reduced costs available at the optimal solution to a relaxation may make it possible to fix variables at zero or one. If the solution to a relaxation is fractional, additional constraints can b...

In this paper, we present a state-of-the-art branch-and-cut (B&C) algorithm for the multicommodity capacitated fixed charge network design problem (MCND). This algorithm combines bounding and branching procedures inspired by the latest developments in mixed-integer programming (MIP) software tools. Several filtering methods that exploit the structure of the MCND are also developed and embedded ...

We describe a rudimentary branch-and-cut algorithm for solving integer bilevel linear programs that extends existing techniques for standard integer linear programs to this very challenging computational setting. The algorithm improves on the branch-and-bound algorithm of Moore and Bard in that it uses cutting plane techniques to produce improved bounds, does not require specialized branching s...

This paper addresses a fuel-constrained, autonomous vehicle path planning problem in the presence of multiple refueling stations. We are given a set of targets, a set of refueling stations, and a depot where m vehicles are stationed. The vehicles are allowed to refuel at any refueling station, and the objective of the problem is to determine a route for each vehicle starting and terminating at ...

Many problems arising in the area of telecommunication ask for solutions with a tree-star topology. This paper proposes a general procedure for finding optimal solutions to a family of these problems. The family includes problems in the literature named as connected facility location, rent-or-buy and generalized Steiner tree-star. We propose a solution framework based on a branch-and-cut algori...

The incorporation of reverse logistics into production routing problems can promote and coordinate the implementation of sustainable development for supply chains. This study aims to incorporate reverse logistics into production routing problems and investigate the reduction of carbon emissions under carbon cap-and-trade. Mixed-integer programming models are proposed for the production routing ...

The Generalized Vehicle Routing Problem (GVRP) consists of finding a set of routes for a number of vehicles with limited capacities on a graph with the vertices partitioned into clusters with given demands such that the total cost of travel is minimized and all demands are met. This paper offers four new integer linear programming formulations for the GVRP, two based on multicommodity flow and ...

A novel approach to pure 0-1 integer programming problems called Resolution Search has been proposed by Chvatal (l997) as an alternative to implicit enumeration, with a demonstration that the method can yield more effective branching strategies. We show that an earlier method called Dynamic Branch-and-Bound (DB&B), due to Glover and Tangedahl (1976), yields the same branching strategies as Reso...