An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems

DOI10.1007/s10614-006-9028-4zbMath1122.90014OpenAlexW2009608161MaRDI QIDQ853587

Dukwon Kim, Panos M. Pardalos, Xin-Yan Pan

Publication date: 17 November 2006

Published in: Computational Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10614-006-9028-4

zbMATH Keywords

tabu searchdynamic slope scaling procedurefixed charge network flow problems

Mathematics Subject Classification ID

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

Related Items

The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation, Bilinear modeling solution approach for fixed charge network flow problems, Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure, A taxonomy of multilayer network design and a survey of transportation and telecommunication applications, Minimum‐cost flow problems having arc‐activation costs, A Combined Matheuristic for the Piecewise Linear Multicommodity Network Flow Problem, Scheduled Service Network Design for Freight Rail Transportation

Uses Software

• CPLEX
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
• Optimization by ghost image processes in neural networks
• A tabu search heuristic procedure for the fixed charge transportation problem
• Some branch-and-bound procedures for fixed-cost transportation problems
• Solving large-scale mixed-integer programs with fixed charge variables
• Tailoring Benders decomposition for uncapacitated network design
• Analysis of a flow problem with fixed charges
• A New Optimization Method for Large Scale Fixed Charge Transportation Problems
• Tabu Search—Part I
• Tabu Search—Part II
• A Simplex-Based Tabu Search Method for Capacitated Network Design
• The fixed charge problem
• Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
• A Branch-and-Bound Method for the Fixed Charge Transportation Problem
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design