Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion

DOI10.1016/j.apm.2016.01.057zbMath1465.90017OpenAlexW2269574626MaRDI QIDQ2292358

Ashkan Fakhri, Mehdi Ghatee

Publication date: 3 February 2020

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2016.01.057

zbMATH Keywords

branch-and-boundBenders decompositionmixed-integer programmingfixed-charge network designconic quadratic problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)

Related Items (4)

Multi-period green reverse logistics network design: an improved Benders-decomposition-based heuristic approach ⋮ A Benders decomposition approach for a real case supply chain network design with capacity acquisition and transporter planning: wheat distribution network ⋮ A study on the optimal inventory allocation for clinical trial supply chains ⋮ Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints

Cites Work

• Unnamed Item
• Tree network design avoiding congestion
• Urban rapid transit network design: accelerated Benders decomposition
• An improved Benders decomposition applied to a multi-layer network design problem
• Partitioning procedures for solving mixed-variables programming problems
• Benders-and-cut algorithm for fixed-charge capacitated network design problem
• A survey on Benders decomposition applied to fixed-charge network design problems
• Dynamic dairy facility location and supply chain planning under traffic congestion and demand uncertainty: a case study of tehran
• A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations
• Speed-up Benders decomposition using maximum density cut (MDC) generation
• Solution of preemptive multi-objective network design problems applying Benders decomposition method
• Generalized Benders decomposition
• Lectures on Modern Convex Optimization
• Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
• Accelerating Benders Decomposition by Local Branching
• Accelerating Benders method using covering cut bundle generation
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
• Algorithms – ESA 2005

This page was built for publication: Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion