Global search algorithms for minimum concave-cost network flow problems
DOI10.1007/BF00130828zbMATH Open0752.90020OpenAlexW1992765037MaRDI QIDQ1200522FDOQ1200522
Authors: Geoffrey M. Guisewite, Panos M. Pardalos 
Publication date: 16 January 1993
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00130828
Recommendations
- Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
- An improved branch and bound algorithm for minimum concave cost network flow problems
- Heuristic solutions for general concave minimum cost network flow problems
- Upper bounds for single-source uncapacitated concave minimum-cost network flow problems
- scientific article; zbMATH DE number 1163712
random searchminimum concave cost network flowlinear underestimationglobal search heuristicrandomly generated test problemssingle-source uncapacitated version
Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Algorithm for Separable Nonconvex Programming Problems
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Minimum Concave Cost Flows in Certain Networks
- Solving the Fixed Charge Problem by Ranking the Extreme Points
- Adjacent extreme flows and application to min concave cost flow problems
- Title not available (Why is that?)
- Optimal Facility Location with Concave Costs
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Parallel search algorithms in global optimization
- An algorithm for the min concave cost flow problem
- An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem
- Minimum cost routing for static network models
- Enumerative techniques for solving some nonconvex global optimization problems
- Title not available (Why is that?)
- Minimizing a sum of staircase functions under linear constraints
- Title not available (Why is that?)
Cited In (16)
- A general purpose exact solution method for mixed integer concave minimization problems
- Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
- A branch-and-bound algorithm for concave network flow problems
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
- Heuristic solutions for general concave minimum cost network flow problems
- GNU Oflox: an academic software for the minimal cost network flow problem
- Parallel computing in nonconvex programming
- Facility location and capacity acquisition: An integrated approach
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
- A deterministic annealing algorithm for the minimum concave cost network flow problem
- An improved branch and bound algorithm for minimum concave cost network flow problems
- Global and local search algorithms for concave cost transshipment problems
- Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables
- Lower bounds from state space relaxations for concave cost network flow problems
- Algorithms for Finding Optimal Flows in Dynamic Networks
- Approximation algorithms for general one-warehouse multi-retailer systems
This page was built for publication: Global search algorithms for minimum concave-cost network flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1200522)
