On the public citation graph

Global search algorithms for minimum concave-cost network flow problems

https://doi.org/10.1007/bf00130828
0 signed · 46 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.3230010205openalex-snapshot
Minimum cost routing for static network models
inferredcites →https://doi.org/10.1002/net.3230090202openalex-snapshot
Adjacent extreme flows and application to min concave cost flow problems
inferredcites →https://doi.org/10.1007/bf00119934openalex-snapshot
Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
inferredcites →https://doi.org/10.1007/bf01096771openalex-snapshot
An improved branch and bound algorithm for minimum concave cost network flow problems
inferredcites →https://doi.org/10.1007/bf01720032openalex-snapshot
Enumerative techniques for solving some nonconvex global optimization problems
inferredcites →https://doi.org/10.1007/bf02283688openalex-snapshot
Minimum concave-cost network flow problems: Applications, complexity, and algorithms
inferredcites →https://doi.org/10.1007/bf02997589openalex-snapshot
Multiflots de coût minimal avec fonctions de coût concaves
inferredcites →https://doi.org/10.1016/0096-3003(89)90014-3openalex-snapshot
Parallel search algorithms in global optimization
inferredcites →https://doi.org/10.1016/0377-2217(80)90109-5openalex-snapshot
An algorithm for the min concave cost flow problem
inferredcites →https://doi.org/10.1049/ep.1978.0470openalex-snapshot
From engineering to cybernetics
inferredcites →https://doi.org/10.1080/02331938808843335openalex-snapshot
Minimizing a sum of staircase functions under linear constraints
inferredcites →https://doi.org/10.1287/mnsc.14.7.429openalex-snapshot
Minimum Concave Cost Flows in Certain Networks
inferredcites →https://doi.org/10.1287/mnsc.15.9.550openalex-snapshot
An Algorithm for Separable Nonconvex Programming Problems
inferredcites →https://doi.org/10.1287/mnsc.18.3.184openalex-snapshot
An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem
inferredcites →https://doi.org/10.1287/moor.12.4.634openalex-snapshot
Send-and-Split Method for Minimum-Concave-Cost Network Flows
inferredcites →https://doi.org/10.1287/opre.16.2.268openalex-snapshot
Solving the Fixed Charge Problem by Ranking the Extreme Points
inferredcites →https://doi.org/10.1287/opre.22.2.373openalex-snapshot
Optimal Facility Location with Concave Costs
inferredcites →https://doi.org/10.1515/9781400862528.50openalex-snapshot
Performance of Local Search In Minimum Concave-Cost Network Flow Problems
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
inferredcites →https://doi.org/10.2307/2551889openalex-snapshot
Applications of Mathematical Programming Techniques.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9783527627981.ch15openalex-snapshot
Optimal Dynamic Flows in Networks and Algorithms for Finding Them
inferred← citeshttps://doi.org/10.1002/nav.20367openalex-snapshot
Approximation algorithms for general one‐warehouse multi‐retailer systems
inferred← citeshttps://doi.org/10.1002/net.3230230208openalex-snapshot
A polynomial time solvable concave network flow problem
inferred← citeshttps://doi.org/10.1007/978-0-387-77247-9_26openalex-snapshot
Multiobjective Control of Time-Discrete Systems and Dynamic Games on Networks
inferred← citeshttps://doi.org/10.1007/978-1-4615-2025-2_11openalex-snapshot
Network Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-12686-4_2openalex-snapshot
Algorithms for Finding Optimal Flows in Dynamic Networks
inferred← citeshttps://doi.org/10.1007/bf01096771openalex-snapshot
An improved branch and bound algorithm for minimum concave cost network flow problems
inferred← citeshttps://doi.org/10.1007/bf02024487openalex-snapshot
Parallel computing in nonconvex programming
inferred← citeshttps://doi.org/10.1007/s00500-019-03951-2openalex-snapshot
A genetic algorithm with local search for solving single-source single-sink nonlinear non-convex minimum cost flow problems
inferred← citeshttps://doi.org/10.1007/s10898-005-1657-yopenalex-snapshot
Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems
inferred← citeshttps://doi.org/10.1007/s10898-005-1658-xopenalex-snapshot
A Branch-and-Bound Algorithm for Concave Network Flow Problems
inferred← citeshttps://doi.org/10.1007/s10898-012-9924-1openalex-snapshot
Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables
inferred← citeshttps://doi.org/10.1016/0305-0548(94)90007-8openalex-snapshot
A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.03.024openalex-snapshot
A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.02.005openalex-snapshot
A general purpose exact solution method for mixed integer concave minimization problems
inferred← citeshttps://doi.org/10.1016/j.tre.2017.07.014openalex-snapshot
Mechanism design for collaborative production-distribution planning with shipment consolidation
inferred← citeshttps://doi.org/10.1023/a:1008373329033openalex-snapshot
A Lagrangian Based Branch-and-Bound Algorithm for Production-transportation Problems
inferred← citeshttps://doi.org/10.1023/a:1026502220076openalex-snapshot
A Dynamic Domain Contraction Algorithm for Nonconvex Piecewise Linear Network Flow Problems*
inferred← citeshttps://doi.org/10.1109/aero.2012.6187325openalex-snapshot
Linear programming relaxations of a network flow problem with applications in machinery industry
inferred← citeshttps://doi.org/10.1109/glocom.2002.1189174openalex-snapshot
Configuration of reserved delivery subnetworks
inferred← citeshttps://doi.org/10.2208/jscejj.24-00167openalex-snapshot
DEMAND-DRIVEN FORMATION OF TRANSPORT NETWORKS: EMERGENCE OF HUB AND SPOKE STRUCTURE
inferred← citeshttps://doi.org/10.5784/21-1-16openalex-snapshot
’n Algoritme vir die minimum van die konkawe knapsakprobleem
inferred← citeshttps://doi.org/10.70675/842f5ceczc2a4z4bc1z8e2fz7508c4fed049openalex-snapshot
Optimisation de l'architecture des réseaux de distribution d'énergie électrique
inferred← citeshttps://doi.org/10.7936/k789146jopenalex-snapshot
Design Issues of Reserved Delivery Subnetworks
inferred← citeshttps://doi.org/10.7936/k7tm78fpopenalex-snapshot
Improved Local Search Algorithms with Multi-Cycle Reduction for Minimum Concave Cost Network Flow Problems
inferred← citeshttps://doi.org/10.7936/k7vd6wp4openalex-snapshot
Design Issues of Reserved Delivery Subnetworks, Doctoral Dissertation, May 2006
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.