Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
type: Item
instance of: scholarly article
title: Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
zbMATH Open document ID: 1067.90014
author: Ilfat Ghamlouche
author: Teodor Gabriel Crainic
author: Michel Gendreau
published in: Annals of Operations Research
publication date: 2005-01-17T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2128872
zbMATH Keywords: Path relinking
zbMATH Keywords: tabu search
zbMATH Keywords: fixed-charge capacitated multicommodity network design
zbMATH Keywords: meta-heuristics
zbMATH Keywords: cycle-based neighbourhoods
MaRDI profile type: Publication
full work available at URL: b:anor.0000039515.90453.1d
OpenAlex ID: W2089233175
DOI: 10.1023/B:ANOR.0000039515.90453.1D
Recommended article: Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
Recommended article: Path relinking approach for multiple allocation hub maximal covering problem
Recommended article: Path relinking for the vehicle routing problem
Recommended article: The capacitated directed cycle hub location and routing problem under congestion
Recommended article: Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs
Recommended article: Design of Capacitated Multicommodity Networks with Multiple Facilities
Recommended article: Q3110084
Recommended article: A combined facility location and network design problem with multi-type of capacitated links
Recommended article: A Cutting-Plane Neighborhood Structure for Fixed-Charge Capacitated Multicommodity Network Design Problem
description: scientific article; zbMATH DE number 2128872