Heuristic solutions for general concave minimum cost network flow problems

No abstract is available for this paper.

• Publication year

  2007

• Venue

  Networks

• Publication date

  2007-08-01

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1002/net.20167
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• From the Library

  2004cited by this paper
• An evolutionary algorithm for manufacturing cell formation

  2004cited by this paper
• A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem

  2003cited by this paper
• A Hybrid Genetic Algorithm for Assembly Line Balancing

  2002cited by this paper
• Solving Fixed-Charge Network Flow Problems with a Hybrid Optimization and Constraint Programming Approach

  2002cited by this paper
• Local search-embedded genetic algorithms for feature selection

  2002cited by this paper
• Linear Approximations in a Dynamic Programming Approach for the Uncapacitated Single-Source Minimum Concave Cost Network Flow Problem in Acyclic Networks

  2001cited by this paper
• A Dynamic Domain Contraction Algorithm for Nonconvex Piecewise Linear Network Flow Problems*

  2000cited by this paper
• Hybrid evolutionary techniques for the maintenance scheduling problem

  2000cited by this paper
• Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems

  2000cited by this paper
• An evolutionary approach for finding optimal trees in undirected networks

  2000cited by this paper
• A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure

  1999cited by this paper
• A HYBRID GENETIC ALGORITHM FOR JOB SHOP SCHEDULING PROBLEM

  1998cited by this paper
• An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks

  1998cited by this paper
• Enhanced Adjacent Extreme-point Search and Tabu Search for the Minimum Concave-cost Uncapacitated Transshipment Problem

  1996cited by this paper
• Genetic Algorithms + Data Structures = Evolution Programs

  1996cited by this paper
• On the Virtues of Parameterized Uniform Crossover

  1995cited by this paper
• On genetic algorithms

  1995cited by this paper
• Genetic Algorithms and Random Keys for Sequencing and Optimization

  1994cited by this paper
• Modern heuristic techniques for combinatorial problems

  1993cited by this paper
• A Method for Solving Network Flow Problems with General Nonlinear Arc Costs

  1993cited by this paper
• Genetic Algorithms in Search Optimization and Machine Learning

  1988cited by this paper
• Some branch and bound techniques for nonlinear optimization

  1988cited by this paper
• Send-and-Split Method for Minimum-Concave-Cost Network Flows

  1987cited by this paper
• An algorithm for the min concave cost flow problem

  1980cited by this paper
• Adjacent extreme flows and application to min concave cost flow problems

  1979cited by this paper
• Minimum Concave Cost Flows in Certain Networks

  1968cited by this paper

• DEMAND-DRIVEN FORMATION OF TRANSPORT NETWORKS: EMERGENCE OF HUB AND SPOKE STRUCTURE

  2025cites this paper
• An advanced Successive Derivative Shortest Path algorithm for concave cost network flow problems

  2025cites this paper
• A Genetic Algorithm for Multi-Capacity Fixed-Charge Flow Network Design

  2024cites this paper
• Biased random-key genetic algorithms: A review

  2023cites this paper
• An Exact Algorithm for Optimization Problems with Inverse S-shaped Function

  2023cites this paper
• A General Purpose Exact Solution Method for Mixed Integer Concave Minimization Problems

  2022cites this paper
• Scalable algorithms for designing CO2 capture and storage infrastructure

  2021cites this paper
• A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation

  2020cites this paper
• A Dynamic Method to Solve the Fixed Charge Network Flow Problem

  2020cites this paper
• Probabilistic tree-based representation for solving minimum cost integer flow problems with nonlinear non-convex cost functions

  2020influential citation
• A genetic algorithm with local search for solving single-source single-sink nonlinear non-convex minimum cost flow problems

  2019cites this paper
• Random-Key Genetic Algorithms

  2018influential citation
• A Probabilistic Tree-Based Representation for Non-convex Minimum Cost Flow Problems

  2018cites this paper
• The Maximum Edge Weight Clique Problem: Formulations and Solution Approaches

  2017cites this paper
• Survey on applications of biased-random key genetic algorithms for solving optimization problems

  2015cites this paper
• The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach

  2014cites this paper
• A Dantzig–Wolfe decomposition algorithm for the constrained minimum cost flow problem

  2014cites this paper
• A hybrid biased random key genetic algorithm approach for the unit commitment problem

  2014cites this paper
• Optimization Methods for the Unit Commitment Problem in Electric Power Systems

  2014cites this paper
• A Multi Population Genetic Algorithm for Hop-Constrained Trees in Nonlinear Cost Flow Networks

  2013cites this paper
• Recent Results on Approximate Optimization Methods for the Unit Commitment Problem

  2013cites this paper
• Information and Computing Sciences

  2012cites this paper
• Concave minimum cost network flow problems solved with a colony of ants

  2012cites this paper
• Ant Colony Optimization Algorithms to solve Nonlinear Network Flow Problems

  2012cites this paper
• Solving Concave Network Flow Problems

  2012cites this paper
• A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks

  2012cites this paper
• Biased random-key genetic algorithms for combinatorial optimization

  2011cites this paper
• OPTIMAL FLOW TREES FOR NETWORKS WITH GENERAL NONLINEAR ARC COSTS

  2011cites this paper
• An ant colony optimization algorithm to solve the minimum cost network flow problem with concave cost functions

  2011cites this paper
• Biased random-key genetic algorithms with applications in telecommunications

  2011cites this paper
• A deterministic annealing algorithm for the minimum concave cost network flow problem

  2011cites this paper
• A particle swarm optimization-based hybrid algorithm for minimum concave cost network flow problems

  2011cites this paper
• SIMULACION Y OPTIMIZACION DE LA CADENA DE SUMINISTRO CON PROGRAMACION LINEAL ENTERA MIXTA

  2011cites this paper
• Bilevel Programming and Linear Approximation of Solving Minimum Concave Cost Multicommodity Flow Problem

  2011cites this paper
• Strategic Design of Distribution System of State-owned Companies : Solution Development:Solution Development

  2010cites this paper
• A Multi Population Genetic Algorithm for Hop-Constrained Trees in Nonlinear Cost Flow Networks 1

  2010cites this paper
• An ant colony system-based hybrid algorithm for square root concave cost transhipment problems

  2010cites this paper
• A Multi-population Genetic Algorithm for Tree-shaped Network Design Problems

  2009cites this paper
• Strategic Design of Distribution System of State-owned Companies : Solution Development

  2009cites this paper
• Bilinear modeling solution approach for fixed charge network flow problems

  2009cites this paper
• ON MINIMUM CONCAVE COST NETWORK FLOW PROBLEMS

  2008cites this paper
• Preface

  2007cites this paper