Global search algorithms for minimum concave-cost network flow problems
From MaRDI portal
Publication:1200522
DOI10.1007/BF00130828zbMath0752.90020OpenAlexW1992765037MaRDI QIDQ1200522
Panos M. Pardalos, G. M. Guisewite
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
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)
Related Items
A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron, Approximation algorithms for general one-warehouse multi-retailer systems, Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables, A general purpose exact solution method for mixed integer concave minimization problems, Algorithms for Finding Optimal Flows in Dynamic Networks, An improved branch and bound algorithm for minimum concave cost network flow problems, Lower bounds from state space relaxations for concave cost network flow problems, 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, Facility location and capacity acquisition: An integrated approach, Parallel computing in nonconvex programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enumerative techniques for solving some nonconvex global optimization problems
- Parallel search algorithms in global optimization
- An algorithm for the min concave cost flow problem
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Minimizing a sum of staircase functions under linear constraints
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Adjacent extreme flows and application to min concave cost flow problems
- Optimal Facility Location with Concave Costs
- Minimum Concave Cost Flows in Certain Networks
- An Algorithm for Separable Nonconvex Programming Problems
- Minimum cost routing for static network models
- An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem
- Solving the Fixed Charge Problem by Ranking the Extreme Points
