Proceedings of the 2005 ACM symposium on Applied computing
Hybrid Lagrangian relaxation for bandwidth-constrained routing: knapsack decomposition
Proceedings of the 2005 ACM symposium on Applied computing
A stabilized column generation scheme for the traveling salesman subtour problem
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Selected Topics in Column Generation
Operations Research
The Profitable Arc Tour Problem: Solution with a Branch-and-Price Algorithm
Transportation Science
Circulation of railway rolling stock: a branch-and-price approach
Computers and Operations Research
Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks
Computational Optimization and Applications
Branch-and-price-and-cut algorithms for solving the reliable h-paths problem
Journal of Global Optimization
A column generation heuristic for a dynamic generalized assignment problem
Computers and Operations Research
0-1 reformulations of the multicommodity capacitated network design problem
Discrete Applied Mathematics
Algorithms for the non-bifurcated network design problem
Journal of Heuristics
Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling
INFORMS Journal on Computing
Exact optimization for the l1-Compressive Sensing problem using a modified Dantzig-Wolfe method
Theoretical Computer Science
Branch and Price for WDM Optical Networks with No Bifurcation of Flow
INFORMS Journal on Computing
A branch-and-price algorithm for the risk-equity constrained routing problem
INOC'11 Proceedings of the 5th international conference on Network optimization
Easy distributions for combinatorial optimization problems with probabilistic constraints
Operations Research Letters
A Branch and Price algorithm for the k-splittable maximum flow problem
Discrete Optimization
An intermodal multicommodity routing problem with scheduled services
Computational Optimization and Applications
Relax-and-fix decomposition technique for solving large scale grid-based location problems
Computers and Industrial Engineering
Grammar-Based Column Generation for Personalized Multi-Activity Shift Scheduling
INFORMS Journal on Computing
Exact Algorithms for a Bandwidth Packing Problem with Queueing Delay Guarantees
INFORMS Journal on Computing
Managing the network with Merlin
Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks
A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem
Journal of Scheduling
A new virtual network static embedding strategy within the Cloud's private backbone network
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
We present a column-generation model and branch-and-price-and-cut algorithm for origin-destination integer multicommodity flow problems. The origin-destination integer multicommodity flow problem is a constrained version of the linear multicommodity flow problem in which flow of a commodity (defined in this case by an origin-destination pair) may use only one path from origin to destination. Branch-and-price-and-cut is a variant of branch-and-bound, with bounds provided by solving linear programs using column-and-cut generation at nodes of the branch-and-bound tree. Because our model contains one variable for each origin destination path, for every commodity, the linear programming relaxations at nodes of the branch-and-bound tree are solved using column generation, i.e., implicit pricing of nonbasic variables to generate new columns or to prove LP optimality. We devise a new branching rule that allows columns to be generated efficiently at each node of the branch-and-bound tree. Then, we describe cuts (cover inequalities) that can be generated at each node of the branch-and-bound tree. These cuts help to strengthen the linear programming relaxation and to mitigate the effects of problem symmetry. We detail the implementation of our combined column and- cut generation method and present computational results for a set of test problems arising from telecommunications applications. We illustrate the value of our branching rule when used to find a heuristic solution and compare branch-and-price and branch-and-price-and-cut methods to find optimal solutions for highly capacitated problems.