Heuristic solutions for general concave minimum cost network flow problems

DOI10.1002/NET.20167zbMATH Open1119.90067OpenAlexW4252658112MaRDI QIDQ3593371FDOQ3593371

Authors: Dalila B. M. M. Fontes, José Fernando Gonçalves 

Publication date: 20 July 2007

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20167

Recommendations

• Global search algorithms for minimum concave-cost network flow problems
• A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
• Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks.
• Upper bounds for single-source uncapacitated concave minimum-cost network flow problems
• scientific article; zbMATH DE number 1163712

zbMATH Keywords

heuristicscombinatorial optimizationlocal searchgenetic algorithmsnetwork flowconcave-cost optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Title not available (Why is that?)

Cited In (14)

• Biased random-key genetic algorithms with applications in telecommunications
• A general purpose exact solution method for mixed integer concave minimization problems
• Global search algorithms for minimum concave-cost network flow problems
• A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
• The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach
• Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure
• A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
• A hybrid biased random key genetic algorithm approach for the unit commitment problem
• A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation
• A deterministic annealing algorithm for the minimum concave cost network flow problem
• Global and local search algorithms for concave cost transshipment problems
• Bilinear modeling solution approach for fixed charge network flow problems
• Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints
• A Lagrangean heuristic for the capacitated concave minimum cost network flow problem

Uses Software

• OR-Library

This page was built for publication: Heuristic solutions for general concave minimum cost network flow problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593371)