A parallel local search framework for the fixed-charge multicommodity network flow problem

DOI10.1016/j.cor.2016.07.016zbMath1391.90119OpenAlexW2495278977MaRDI QIDQ1652019

Vikas Goel, Lluís-Miquel Munguía, Yufen Shao, David A. Bader, Shabbir Ahmed, Nemhauser, George I.

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.07.016

zbMATH Keywords

parallel computingdiscrete optimizationprimal heuristicsmulticommodity capacitated network designfcmnf

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items

Minimum‐cost flow problems having arc‐activation costs, MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem, Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs

Uses Software

• MPI

Cites Work

• A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
• Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
• Scatter search for network design problem
• A capacity scaling heuristic for the multicommodity capacitated network design problem
• A local branching heuristic for the capacitated fixed-charge network design problem
• Local branching
• A first multilevel cooperative algorithm for capacitated multicommodity network design
• An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions
• Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
• A COMBINED CAPACITY SCALING AND LOCAL BRANCHING APPROACH FOR CAPACITATED MULTI-COMMODITY NETWORK DESIGN PROBLEM
• An Efficient Heuristic Procedure for Partitioning Graphs
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• Handbook of metaheuristics