A sequential reduction algorithm for the large-scale fixed-charge network flow problems

DOI10.1007/s11590-023-02040-6zbMATH Open1547.90221MaRDI QIDQ6542455

Zhou-Wang Yang, Lu Yang

Publication date: 22 May 2024

Published in: Optimization Letters (Search for Journal in Brave)

zbMATH Keywords

heuristic algorithmtransportation problemedge deletionfixed-charge network flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Bilinear modeling solution approach for fixed charge network flow problems
• An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems
• 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
• Solving a fuzzy fixed charge solid transportation problem using batch transferring by new approaches in meta-heuristic
• A survey on Benders decomposition applied to fixed-charge network design problems
• Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems
• A bilinear relaxation based algorithm for concave piecewise linear network flow problems
• Adaptive dynamic cost updating procedure for solving fixed charge network flow problems
• A generic view of Dantzig--Wolfe decomposition in mixed integer programming
• Modeling and solving a multimodal transportation problem with flexible-time and scheduled services
• Finding Minimum-Cost Circulations by Successive Approximation
• The fixed charge problem

This page was built for publication: A sequential reduction algorithm for the large-scale fixed-charge network flow problems