Two- and three-index formulations of the minimum cost multicommodity \(k\)-splittable flow problem
type: Item
instance of: scholarly article
title: Two- and three-index formulations of the minimum cost multicommodity \(k\)-splittable flow problem
zbMATH Open document ID: 1175.90038
author: M. Gamst
author: Peter Neergaard Jensen
author: David Pisinger
author: Christian E. M. Plum
published in: European Journal of Operational Research
publication date: 2009-11-17T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5634740
zbMATH Keywords: network flows
zbMATH Keywords: transportation
zbMATH Keywords: decomposition
zbMATH Keywords: multicommodity flow
MaRDI profile type: Publication
full work available at URL: j.ejor.2009.05.014
OpenAlex ID: W1985363832
Wikidata QID: Q58826410
cites work: Q3056948
cites work: Q4735941
cites work: Q4411349
cites work: Introduction to algorithms
cites work: Decomposition Principle for Linear Programs
cites work: A suggested computation for maximal multi-commodity network flows
cites work: Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
cites work: Q4886084
cites work: Approximation and Online Algorithms
cites work: An augmented Lagrangian algorithm for large scale multicommodity routing
cites work: A Branch and Price algorithm for the \(k\)-splittable maximum flow problem
cites work: k -Splittable delay constrained routing problem: A branch-and-price approach
cites work: The shortest path problem with forbidden paths
DOI: 10.1016/J.EJOR.2009.05.014
description: scientific article; zbMATH DE number 5634740