An exact algorithm for a multicommodity min-cost flow over time problem
type: Item
instance of: scholarly article
title: An exact algorithm for a multicommodity min-cost flow over time problem
zbMATH Open document ID: 1392.90024
author: Enrico Grande
author: Gaia Nicosia
author: Andrea Pacifici
author: Vincenzo Roselli
publication date: 2018-04-11T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 6858350
zbMATH Keywords: flows over time
zbMATH Keywords: multicommodity flow
zbMATH Keywords: linear programming
zbMATH Keywords: column generation
zbMATH Keywords: exact algorithm
describes a project that uses: RelaxIV
describes a project that uses: NETGEN
MaRDI profile type: Publication
full work available at URL: j.endm.2018.01.014
OpenAlex ID: W2789228271
cites work: Cheapest paths in dynamic networks
cites work: Q4471275
cites work: Quickest Flows Over Time
cites work: Constructing Maximal Dynamic Flows from Static Flows
cites work: Minimum cost paths over dynamic networks
cites work: Multicommodity flows over time: Efficient algorithms and complexity
cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
cites work: Minimum-cost dynamic flows: The series-parallel case
cites work: An Introduction to Network Flows over Time
DOI: 10.1016/J.ENDM.2018.01.014
description: scientific article; zbMATH DE number 6858350