A Branch and Price algorithm for the \(k\)-splittable maximum flow problem
type: Item
instance of: scholarly article
title: A Branch and Price algorithm for the \(k\)-splittable maximum flow problem
zbMATH Open document ID: 1140.90481
author: Jérôme Truffot
author: Christophe Duhamel
published in: Discrete Optimization
publication date: 2008-08-15T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 5312366
zbMATH Keywords: max flow
zbMATH Keywords: flow width
zbMATH Keywords: column generation
zbMATH Keywords: Branch and Price
MaRDI profile type: Publication
full work available at URL: j.disopt.2008.01.002
OpenAlex ID: W2087284990
cites work: Q3056948
cites work: On splittable and unsplittable flow capacitated network design arc-set polyhedra.
cites work: Q4411349
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: A tree-search algorithm for mixed integer programming problems
cites work: Decomposition Principle for Linear Programs
cites work: A suggested computation for maximal multi-commodity network flows
cites work: Approximation and Online Algorithms
cites work: Minimum-cost single-source 2-splittable flow
cites work: An Automatic Method of Solving Discrete Programming Problems
cites work: Selected Topics in Column Generation
cites work: Algorithms – ESA 2004
cites work: Improving Discrete Model Representations via Symmetry Considerations
cites work: An exact algorithm for IP column generation
DOI: 10.1016/J.DISOPT.2008.01.002
description: scientific article; zbMATH DE number 5312366