A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem
type: Item
instance of: scholarly article
title: A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem
zbMATH Open document ID: 1391.90612
author: Anna Melchiori
author: Antonino Sgalambro
published in: Computers \& Operations Research
publication date: 2018-07-12T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6902793
zbMATH Keywords: quickest flow
zbMATH Keywords: \(k\)-splittable flow
zbMATH Keywords: matheuristics
zbMATH Keywords: flows over time
zbMATH Keywords: multicommodity
describes a project that uses: irace
MaRDI profile type: Publication
full work available at URL: j.cor.2017.12.012
OpenAlex ID: W2771254313
cites work: Q3056948
cites work: A survey of dynamic network flows
cites work: The \(k\)-splittable flow problem
cites work: The quickest flow problem
cites work: An exact approach for the maximum concurrent \(k\)-splittable flow problem
cites work: On the approximation of the single source \(k\)-splittable flow problem
cites work: A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem
cites work: The quickest path problem
cites work: Internet packet routing: application of a \(K\)-quickest path algorithm
cites work: Q4737515
cites work: Quickest Flows Over Time
cites work: Q3292914
cites work: Constructing Maximal Dynamic Flows from Static Flows
cites work: Transient flows in networks
cites work: A local search heuristic for the multi-commodity \(k\)-splittable maximum flow problem
cites work: Two- and three-index formulations of the minimum cost multicommodity \(k\)-splittable flow problem
cites work: Comparing branch-and-price algorithms for the multi-commodity \(k\)-splittable maximum flow problem
cites work: Multicommodity flows over time: Efficient algorithms and complexity
cites work: An FPTAS for quickest multicommodity flows with inflow-dependent transit times
cites work: Variable neighborhood search: Principles and applications
cites work: Q4886085
cites work: Minimum-cost dynamic flows: The series-parallel case
cites work: Complexity and approximability of \(k\)-splittable flows
cites work: Traffic Networks and Flows over Time
cites work: On the Quickest Flow Problem in Dynamic Networks – A Parametric Min-Cost Flow Approach
cites work: Flows on few paths: Algorithms and lower bounds
cites work: An algorithm for ranking quickest simple paths
cites work: A comprehensive survey on the quickest path problem
cites work: Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm
cites work: Randomized rounding: A technique for provably good algorithms and algorithmic proofs
cites work: Fast and Memory-Efficient Algorithms for Evacuation Problems
cites work: An Introduction to Network Flows over Time
cites work: Combining metaheuristics with mathematical programming, constraint programming and machine learning
cites work: A Branch and Price algorithm for the \(k\)-splittable maximum flow problem
cites work: Finding the K Shortest Loopless Paths in a Network
DOI: 10.1016/J.COR.2017.12.012
Recommended article: A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem
Recommended article: Q4737515
Recommended article: Fast deterministic approximation for the multicommodity flow problem
Recommended article: Q4886082
Recommended article: Fast approximation algorithms for multicommodity flow problems
Recommended article: A local search heuristic for the multi-commodity \(k\)-splittable maximum flow problem
Recommended article: Q4886083
Recommended article: Approximation and Online Algorithms
Recommended article: A Combined Matheuristic for the Piecewise Linear Multicommodity Network Flow Problem
description: scientific article; zbMATH DE number 6902793