Log In Sign Up

Exact solution of network flow models with strong relaxations

by   Vinícius L. de Lima, et al.

We address the solution of Mixed Integer Linear Programming (MILP) models with strong relaxations that are derived from Dantzig-Wolfe decompositions and allow a pseudo-polynomial pricing algorithm. We exploit their network-flow characterization and provide a framework based on column generation, reduced-cost variable-fixing, and a highly asymmetric branching scheme that allows us to take advantage of the potential of the current MILP solvers. We apply our framework to a variety of cutting and packing problems from the literature. The efficiency of the framework is proved by extensive computational experiments, in which a significant number of open instances could be solved to proven optimality for the first time.


page 1

page 2

page 3

page 4


Arc Flow Formulations Based on Dynamic Programming: Theoretical Foundations and Applications

Network flow formulations are among the most successful tools to solve o...

Joint optimization of train blocking and shipment path:An integrated model and a sequential algorithm

The INFORMS RAS 2019 Problem Solving Competition is focused on the integ...

A Parallelizable Acceleration Framework for Packing Linear Programs

This paper presents an acceleration framework for packing linear program...

A Kernel Search Algorithm for Virtual Machine Consolidation Problem

Virtual machine consolidation describes the process of reallocation of v...

From approximate to exact integer programming

Approximate integer programming is the following: For a convex body K ⊆ℝ...

Mixed-Integer Programming for the ROADEF/EURO 2020 challenge

The ROADEF 2020 challenge presents a maintenance scheduling problem from...

An exact solution framework for the multiple gradual cover location problem

Facility and covering location models are key elements in many decision ...