A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem

DOI10.1016/j.cor.2017.12.012zbMath1391.90612OpenAlexW2771254313MaRDI QIDQ1651593

Anna Melchiori, Antonino Sgalambro

Publication date: 12 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2017.12.012

zbMATH Keywords

matheuristicsquickest flowflows over time\(k\)-splittable flowmulticommodity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items

Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation, Minimum‐cost flow problems having arc‐activation costs, A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem

Uses Software

• irace

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparing branch-and-price algorithms for the multi-commodity \(k\)-splittable maximum flow problem
• The \(k\)-splittable flow problem
• A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem
• Complexity and approximability of \(k\)-splittable flows
• Internet packet routing: application of a \(K\)-quickest path algorithm
• An FPTAS for quickest multicommodity flows with inflow-dependent transit times
• The quickest path problem
• A survey of dynamic network flows
• Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm
• An exact approach for the maximum concurrent \(k\)-splittable flow problem
• On the approximation of the single source \(k\)-splittable flow problem
• A Branch and Price algorithm for the \(k\)-splittable maximum flow problem
• Two- and three-index formulations of the minimum cost multicommodity \(k\)-splittable flow problem
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Transient flows in networks
• An algorithm for ranking quickest simple paths
• Multicommodity flows over time: Efficient algorithms and complexity
• A comprehensive survey on the quickest path problem
• A local search heuristic for the multi-commodity \(k\)-splittable maximum flow problem
• An Introduction to Network Flows over Time
• Traffic Networks and Flows over Time
• The quickest flow problem
• Minimum-cost dynamic flows: The series-parallel case
• Fast and Memory-Efficient Algorithms for Evacuation Problems
• On the Quickest Flow Problem in Dynamic Networks – A Parametric Min-Cost Flow Approach
• Constructing Maximal Dynamic Flows from Static Flows
• Quickest Flows Over Time
• Flows on few paths: Algorithms and lower bounds
• Finding the K Shortest Loopless Paths in a Network
• Combining metaheuristics with mathematical programming, constraint programming and machine learning
• Variable neighborhood search: Principles and applications