An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems
From MaRDI portal
Publication:853587
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
Cites work
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- A Branch-and-Bound Method for the Fixed Charge Transportation Problem
- A New Optimization Method for Large Scale Fixed Charge Transportation Problems
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- A tabu search heuristic procedure for the fixed charge transportation problem
- Analysis of a flow problem with fixed charges
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Optimization by ghost image processes in neural networks
- Solving large-scale mixed-integer programs with fixed charge variables
- Some branch-and-bound procedures for fixed-cost transportation problems
- Tabu Search—Part I
- Tabu Search—Part II
- Tailoring Benders decomposition for uncapacitated network design
- Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
- The fixed charge problem
Cited in
(13)- A combined matheuristic for the piecewise linear multicommodity network flow problem
- 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
- An extreme‐point tabu‐search algorithm for fixed‐charge network 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
- Successive smoothing algorithm for solving large-scale optimization models with fixed cost
- Adaptive dynamic cost updating procedure for solving fixed charge network flow problems
- Bilinear modeling solution approach for fixed charge network flow problems
- Minimum‐cost flow problems having arc‐activation costs
- Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation
- Scheduled service network design for freight rail transportation
- A sequential reduction algorithm for the large-scale fixed-charge network flow problems
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)
