On the public citation graph
An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks
0 signed · 32 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230230208openalex-snapshot
A polynomial time solvable concave network flow problem
inferredcites →https://doi.org/10.1007/978-1-4615-2025-2openalex-snapshot
Handbook of Global Optimization
inferredcites →https://doi.org/10.1007/978-3-642-59179-2_3openalex-snapshot
Solution Methods for Nonconvex Network 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/bf02192199openalex-snapshot
Decomposition approach for the global minimization of biconcave functions over polytopes
inferredcites →https://doi.org/10.1007/bf02283688openalex-snapshot
Minimum concave-cost network flow problems: Applications, complexity, and algorithms
inferredcites →https://doi.org/10.1007/bf02283698openalex-snapshot
A note on adapting methods for continuous global optimization to the discrete case
inferredcites →https://doi.org/10.1023/a:1018364802456openalex-snapshot
Global Optimization Techniques for Solving the General Quadratic Integer Programming Problem
inferredcites →https://doi.org/10.1142/9789812798190_0008openalex-snapshot
Minimum Concave-Cost Network Flow Problems with a Single Nonlinear Arc Cost
inferredcites →https://doi.org/10.1142/9789812798190_0009openalex-snapshot
A Method for Solving Network Flow Problems with General Nonlinear Arc Costs
inferredcites →https://doi.org/10.1287/mnsc.15.9.550openalex-snapshot
An Algorithm for Separable Nonconvex Programming Problems
inferredcites →https://doi.org/10.1287/opre.22.2.373openalex-snapshot
Optimal Facility Location with Concave Costs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.20167openalex-snapshot
Heuristic solutions for general concave minimum cost network flow problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-3437-8_3openalex-snapshot
Global Minimization of Separable Concave Functions under Linear Constraints with Totally Unimodular Matrices
inferred← citeshttps://doi.org/10.1007/bf02578964openalex-snapshot
Two level hierarchical time minimizing transportation problem
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/s10732-012-9214-6openalex-snapshot
Concave minimum cost network flow problems solved with a colony of ants
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-005-1678-6openalex-snapshot
Exact Algorithm for Concave Knapsack Problems: Linear Underestimation and Partition Method
inferred← citeshttps://doi.org/10.1007/s10898-006-9128-7openalex-snapshot
Computing exact solution to nonlinear integer programming: Convergent Lagrangian and objective level cut method
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/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.trc.2006.08.006openalex-snapshot
A Lagrangian relaxation based heuristic for the consolidation problem of airfreight forwarders
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2602301openalex-snapshot
An adaptive tabu-simulated annealing for concave cost transportation problems
inferred← citeshttps://doi.org/10.1080/00207160.2017.1418505openalex-snapshot
A new exact algorithm for concave knapsack problems with integer variables
inferred← citeshttps://doi.org/10.1080/00207543.2021.1925771openalex-snapshot
The economic lot-sizing problem with remanufacturing and heterogeneous returns: formulations, analysis and algorithms
inferred← citeshttps://doi.org/10.1145/2001576.2001596openalex-snapshot
An ant colony optimization algorithm to solve the minimum cost network flow problem with concave cost functions
inferred← citeshttps://doi.org/10.1287/trsc.2022.1150openalex-snapshot
Two-Level Capacitated Discrete Location with Concave Costs
inferred← citeshttps://doi.org/10.4018/978-1-6684-8386-2.ch003openalex-snapshot
A Discussion on Non-Convex Optimization Problems Arising in Supply Chain Design and Finance
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.