• Corpus ID: 119176773

Solving Splitted Multi-Commodity Flow Problem by Efficient Linear Programming Algorithm

@article{Dai2019SolvingSM,
  title={Solving Splitted Multi-Commodity Flow Problem by Efficient Linear Programming Algorithm},
  author={Liyun Dai and Hengjun Zhao and Zhiming Liu},
  journal={arXiv: Optimization and Control},
  year={2019}
}
Column generation is often used to solve multi-commodity flow problems. A program for column generation always includes a module that solves a linear equation. In this paper, we address three major issues in solving linear problem during column generation procedure which are (1) how to employ the sparse property of the coefficient matrix; (2) how to reduce the size of the coefficient matrix; and (3) how to reuse the solution to a similar equation. To this end, we first analyze the sparse… 

Figures and Tables from this paper

References

SHOWING 1-10 OF 43 REFERENCES

A column generation and partitioning approach for multi-commodity flow problems

TLDR
This paper presents a partitioning solution procedure for large-scale multi-commodity flow problems with many commodities, such as those encountered in the telecommunications industry, using a cycle-based multi- commodity formulation and column generation techniques.

A Decomposition-Based Pricing Procedure for Large-Scale Linear Programs: An Application to the Linear Multicommodity Flow Problem

We propose and test a new pricing procedure for solving large-scale structured linear programs. The procedure interactively solves a relaxed subproblem to identify potential entering basic columns.

Comparison of bundle and classical column generation

TLDR
Alternative stabilization techniques used in column generation are reviewed, comparing them from both primal and dual points of view, and a sketchy comparison with the volume algorithm is given.

A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation

The multicommodity network-flow model concerns routing of a number of commodities through a capacitated network at minimal cost. In the basic model, it is assumed that for each commodity, the flow

Combining Column Generation and Lagrangian Relaxation

TLDR
This paper focuses on solving the LP relaxation of the Dantzig-Wolfe master problem, and applies Lagrangian relaxation directly to this extended formulation, i.e. no simplex method is used.

Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem

Approximating fractional packings and coverings in O(1/ε) iterations

TLDR
The quadratic program can be approximated to any degree of accuracy by an appropriately defined piecewise-linear program and extensions to the maximum multicommodity flow problem, the pure covering problem, and mixed packing- covering problem are described.

A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation

Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints

TLDR
This paper presents block-coordinate descent algorithms for the approximate solution of large structured convex programming problems and shows that feasibility as well as min-mix resource-sharing problems for such constraints can be solved to a relative accuracy.