Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem

@article{Atamtrk2017PathCA,
  title={Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem},
  author={Alper Atamt{\"u}rk and Simge K{\"u}ç{\"u}kyavuz and Birce Tezel},
  journal={SIAM J. Optim.},
  year={2017},
  volume={27},
  pages={1943-1976}
}
Capacitated fixed-charge network flows are used to model a variety of problems in telecommunication, facility location, production planning, and supply chain management. In this paper, we investigate capacitated path substructures and derive strong and easy-to-compute path cover and path pack inequalities. These inequalities are based on an explicit characterization of the submodular inequalities through a fast computation of parametric minimum cuts on a path, and they generalize the well-known… 

Figures and Tables from this paper

Submodular Inequalities for the Path Structures of the Capacitated Fixed-Charge Network Flow Problems

TLDR
This thesis investigates capacitated path substructures and derive strong and easy-to-compute path cover and path pack inequalities and proposes extensions of these inequalities where the binary variables for inventory and backlogging are lifted.

Minimum‐cost flow problems having arc‐activation costs

TLDR
A mixed‐integer programming (MIP) model along with a series of symmetry‐breaking inequalities for solving the MCFA is presented and it is shown that this algorithm finitely terminates with an optimal MCFA solution.

Two-level lot-sizing with inventory bounds

A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation

TLDR
This work proposes an iterative route-then-schedule approach for centralized planning that quickly converges to high-quality solutions and analyzes a collection of valid inequalities for the individual problems of assigning vehicles to routes and scheduling the times that vehicles traverse their routes.

Theoretical challenges towards cutting-plane selection

TLDR
The different classes of cutting-planes available, known theoretical results about their relative strength, important issues pertaining to cut selection, and some possible new directions to be pursued in order to accomplish cutting-plane selection in a more principled manner are reviewed.

O C ] 7 M ay 2 01 8 Theoretical challenges towards cutting-plane selection

While many classes of cutting-planes are at the disposal of integer programming solvers, our scientific understanding is far from complete with regards to cutting-plane selection, i.e., the task of

Integer Programming and Combinatorial Optimization: 21st International Conference, IPCO 2020, London, UK, June 8–10, 2020, Proceedings

TLDR
It is conjecture that every 4-wise intersecting clutter is non-ideal, and the proof is proved in the binary case using Jaeger's 8-flow theorem for graphs and Seymour's characterization of the binary matroids with the sums of circuits property.

Supermodularity and valid inequalities for quadratic optimization with indicators

TLDR
It is shown that the convex hull of the epigraph of the quadratic can be obtaining from inequalities for the underlying supermodular set function by lifting them into nonlinear inequalities in the original space of variables.

Sequence Independent Lifting for the Set of Submodular Maximization Problem

TLDR
The polyhedral structure of a mixed 0-1 set arising in the submodular maximization problem is studied and a new class of facet-defining inequalities for the convex hull of P through multidimensional sequence independent lifting is proposed.

Submodular Function Minimization and Polarity

TLDR
Using polarity, an outer polyhedral approximation is given for the epigraph of set functions and it is proved that the corresponding polar relaxation is exact; hence, it is equivalent to the Lovasz extension.

References

SHOWING 1-10 OF 19 REFERENCES

Fixed-charge transportation on a path: optimization, LP formulations and separation

TLDR
A polyhedral analysis of the polynomially solvable special case in which the associated bipartite graph is a path, which describes a new class of inequalities that are called “path-modular” inequalities and shows that these inequalities suffice to describe the convex hull of the set of feasible solutions.

A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem

We present a branch‐and‐cut algorithm to solve the single‐commodity, uncapacitated, fixed‐charge network flow problem, which includes the Steiner tree problem, uncapacitated lot‐sizing problems, and

Lot-size models with backlogging: Strong reformulations and cutting planes

TLDR
An implicit description of the convex hull of solutions is given, and it is shown how the problem of finding a violated cutting plane can be solved as a linear program.

Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation

TLDR
Two models of the polyhedral structure of the lot-sizing problem with inventory bounds and fixed costs are investigated and facet-defining inequalities that make use of the inventory bounds explicitly are identified.

Valid inequalities and separation for uncapacitated fixed charge networks

Lot-sizing with fixed charges on stocks: the convex hull

A study of the lot-sizing polytope

TLDR
A polynomial–time combinatorial separation algorithm is given for the inequalities of the lot-sizing polytope that cut off all fractional extreme points of its linear programming relaxation, as well as liftings from those facets.