A capacity scaling heuristic for the multicommodity capacitated network design problem

Naoto Katayama; M. Chen; Mikio Kubo

doi:10.1016/j.cam.2008.10.055

ScienceGate Book Chapters

JOURNAL ARTICLE

A capacity scaling heuristic for the multicommodity capacitated network design problem

Naoto Katayama M. Chen Mikio Kubo

Year: 2008 Journal: Journal of Computational and Applied Mathematics Vol: 232 (1)Pages: 90-101 Publisher: Elsevier BV

DOI: 10.1016/j.cam.2008.10.055

Get Full-Text PDF Get Analytical Report

Keywords:

Heuristic Mathematics Mathematical optimization Column generation Network planning and design Scaling Flow network Multi-commodity flow problem Algorithm Computer science

Metrics

Cited By

5.41

FWCI (Field Weighted Citation Impact)

Refs

0.95

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Vehicle Routing Optimization Methods

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Advanced Optical Network Technologies

Physical Sciences → Engineering → Electrical and Electronic Engineering

Optimization and Packing Problems

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

A capacity scaling heuristic for the multicommodity capacitated network design problem

Metrics

Citation History

Topics

Related Documents

A combined fast greedy heuristic for the capacitated multicommodity network design problem

Multicommodity Capacitated Network Design

A Graph-Induced Neighborhood Search Heuristic for the Capacitated Multicommodity Network Design Problem

Hybrid heuristic for Capacitated Network Design Problem

A Slope Scaling/Lagrangean Perturbation Heuristic with Long-Term Memory for Multicommodity Capacitated Fixed-Charge Network Design