A multi-start variable neighborhood search for solving the single path multicommodity flow problem
type: Item
instance of: scholarly article
title: A multi-start variable neighborhood search for solving the single path multicommodity flow problem
zbMATH Open document ID: 1328.90019
author: A. Guitouni
author: H. Masri
author: Saoussen Krichen
published in: Applied Mathematics and Computation
publication date: 2016-01-04T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6526091
zbMATH Keywords: multicommodity flow problem
zbMATH Keywords: routing problem
zbMATH Keywords: variable neighborhood search
describes a project that uses: LINGO
describes a project that uses: LINDO
MaRDI profile type: Publication
full work available at URL: j.amc.2014.10.123
OpenAlex ID: W2061787683
cites work: Q3056948
cites work: Multicommodity network flows—A survey
cites work: Q4411349
cites work: Q4363157
cites work: An ant colony optimization metaheuristic for single-path multicommodity network flow problems
cites work: Approximability of unsplittable shortest path routing problems
cites work: Attraction probabilities in variable neighborhood search
cites work: Q5480099
cites work: Variable neighborhood search: Principles and applications
cites work: A multicommodity network-flow problem with side constraints on paths solved by column generation
cites work: A Survey of Linear Cost Multicommodity Network Flows
cites work: Variable neighborhood search
cites work: A Survey of Algorithms for Convex Multicommodity Flow Problems
cites work: Routing and scheduling connections in networks that support advance reservations
DOI: 10.1016/J.AMC.2014.10.123
description: scientific article; zbMATH DE number 6526091