A COMBINED CAPACITY SCALING AND LOCAL BRANCHING APPROACH FOR CAPACITATED MULTI-COMMODITY NETWORK DESIGN PROBLEM

DOI10.17654/FJAMJul2015_001_030zbMath1325.90015OpenAlexW2520636539MaRDI QIDQ3452686

Naoto Katayama

Publication date: 13 November 2015

Published in: Far East Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.pphmj.com/abstract/9222.htm

zbMATH Keywords

local branchingcapacitated network designcapacity scaling

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (6)

A parallel local search framework for the fixed-charge multicommodity network flow problem ⋮ The transit time constrained fixed charge multi-commodity network design problem ⋮ A Combined Matheuristic for the Piecewise Linear Multicommodity Network Flow Problem ⋮ MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem ⋮ Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design ⋮ Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design

This page was built for publication: A COMBINED CAPACITY SCALING AND LOCAL BRANCHING APPROACH FOR CAPACITATED MULTI-COMMODITY NETWORK DESIGN PROBLEM