An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems
DOI10.1007/S10614-006-9028-4zbMATH Open1122.90014OpenAlexW2009608161MaRDI QIDQ853587FDOQ853587
Authors: 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
Recommendations
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- scientific article; zbMATH DE number 1836457
- Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach
- Adaptive dynamic cost updating procedure for solving fixed charge network flow problems
- Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
- An extreme‐point tabu‐search algorithm for fixed‐charge network problems
- Bilinear modeling solution approach for fixed charge network flow problems
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- An affine scaling method for solving network flow problems
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Search theory (90B40)
Cites Work
- Title not available (Why is that?)
- Tabu Search—Part I
- A tabu search heuristic procedure for the fixed charge transportation problem
- Title not available (Why is that?)
- Analysis of a flow problem with fixed charges
- Tabu Search—Part II
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- Some branch-and-bound procedures for fixed-cost transportation problems
- Tailoring Benders decomposition for uncapacitated network design
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- The fixed charge problem
- A Branch-and-Bound Method for the Fixed Charge Transportation Problem
- Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- A New Optimization Method for Large Scale Fixed Charge Transportation Problems
- Optimization by ghost image processes in neural networks
- Solving large-scale mixed-integer programs with fixed charge variables
Cited In (11)
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation
- Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure
- A Combined Matheuristic for the Piecewise Linear Multicommodity Network Flow Problem
- A taxonomy of multilayer network design and a survey of transportation and telecommunication applications
- Adaptive dynamic cost updating procedure for solving fixed charge network flow problems
- Minimum‐cost flow problems having arc‐activation costs
- Bilinear modeling solution approach for fixed charge network flow problems
- Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation
- A sequential reduction algorithm for the large-scale fixed-charge network flow problems
- Scheduled service network design for freight rail transportation
Uses Software
This page was built for publication: An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853587)
