On the public citation graph
The Minimum Concave Cost Network Flow Problem with fixed numbers of sources and nonlinear arc costs
0 signed · 52 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/9781118627372openalex-snapshot
Integer and Combinatorial Optimization
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.1002/net.3230190305openalex-snapshot
Networks synthesis and optimum network design problems: Models, solution methods and applications
inferredcites →https://doi.org/10.1002/net.3230230208openalex-snapshot
A polynomial time solvable concave network flow problem
inferredcites →https://doi.org/10.1007/978-3-642-46955-8_62openalex-snapshot
A Production-Transportation Problem with Stochastic Demand and Concave Production Costs
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/bf00121300openalex-snapshot
The complementary convex structure in global optimization
inferredcites →https://doi.org/10.1007/bf01581088openalex-snapshot
Open questions in complexity theory for numerical optimization
inferredcites →https://doi.org/10.1007/bf02283688openalex-snapshot
Minimum concave-cost network flow problems: Applications, complexity, and algorithms
inferredcites →https://doi.org/10.1007/bf02579369openalex-snapshot
A strongly polynomial minimum cost circulation algorithm
inferredcites →https://doi.org/10.1007/bf02592091openalex-snapshot
A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables
inferredcites →https://doi.org/10.1007/bf03167893openalex-snapshot
A decomposition method for the min concave cost flow problem with a staircase structure
inferredcites →https://doi.org/10.1007/bfb0121124openalex-snapshot
Decomposing the requirement space of a transporation problem into polyhedral cones
inferredcites →https://doi.org/10.1007/s101070050050openalex-snapshot
A production-transportation problem with stochastic demand and concave production costs
inferredcites →https://doi.org/10.1016/0167-6377(93)90102-mopenalex-snapshot
Strongly polynomial time algorithms for certain concave minimization problems on networks
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.1080/02331939208843778openalex-snapshot
An efficient solution method for rank two quasiconcave minimization problems
inferredcites →https://doi.org/10.1080/02331939308843882openalex-snapshot
Strongly polynomial algorithm for a production-transportation problem with concave production cost
inferredcites →https://doi.org/10.1080/02331939508844033openalex-snapshot
Strongly polynomial algorithm for two special minimum concave cost network flow problems
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/9789814354363_0009openalex-snapshot
Complexity Issues in Nonconvex Network Flow Problems
inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
inferredcites →https://doi.org/10.1287/mnsc.1040.0262openalex-snapshot
Dynamic Version of the Economic Lot Size Model
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.506openalex-snapshot
A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
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/mnsc.5.1.89openalex-snapshot
Dynamic Version of the Economic Lot Size Model
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/moor.8.4.538openalex-snapshot
Integer Programming with a Fixed Number of Variables
inferredcites →https://doi.org/10.1287/opre.17.2.262openalex-snapshot
Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
inferredcites →https://doi.org/10.2307/2583737openalex-snapshot
Integer and Combinatorial Optimization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4613-0233-9_2openalex-snapshot
Heuristic Approaches to Production-Inventory-Distribution Problems in Supply Chains
inferred← citeshttps://doi.org/10.1007/978-1-4615-2025-2_4openalex-snapshot
D.C. Optimization: Theory, Methods and Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4757-3145-3_30openalex-snapshot
The MCCNF Problem With a Fixed Number of Nonlinear Arc Costs: Complexity and Approximation
inferred← citeshttps://doi.org/10.1007/bf00229302openalex-snapshot
A decomposition algorithm for solving certain classes of production-transportation problems with concave production cost
inferred← citeshttps://doi.org/10.1007/bf02592091openalex-snapshot
A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables
inferred← citeshttps://doi.org/10.1007/bf03167328openalex-snapshot
An algorithm for a concave production cost network flow problem
inferred← citeshttps://doi.org/10.1007/s10107-014-0752-6openalex-snapshot
Minimum concave cost flow over a grid network
inferred← citeshttps://doi.org/10.1007/s10288-005-0078-6openalex-snapshot
Complexity and algorithms for convex network optimization and other nonlinear problems
inferred← citeshttps://doi.org/10.1007/s10479-007-0172-6openalex-snapshot
Complexity and algorithms for nonlinear optimization problems
inferred← citeshttps://doi.org/10.1007/s10898-019-00750-9openalex-snapshot
On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems
inferred← citeshttps://doi.org/10.1007/s10957-011-9863-xopenalex-snapshot
On a Finite Branch and Bound Algorithm for the Global Minimization of a Concave Power Law Over a Polytope
inferred← citeshttps://doi.org/10.1016/s0167-6377(96)00040-5openalex-snapshot
Minimizing a linear multiplicative-type function under network flow constraints
inferred← citeshttps://doi.org/10.1023/a:1008278625289openalex-snapshot
A Pseudo-Polynomial Primal-Dual Algorithm for Globally Solving a Production-Transportation Problem
inferred← citeshttps://doi.org/10.1023/a:1018937113330openalex-snapshot
A parametric approach for maximum flow problems with an additional reverse convex constraint
inferred← citeshttps://doi.org/10.1080/07408170590899607openalex-snapshot
Dynamic lot size problems with one-way product substitution
inferred← citeshttps://doi.org/10.1137/15m1045715openalex-snapshot
On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid
inferred← citeshttps://doi.org/10.1137/18m121873xopenalex-snapshot
Subdeterminants and Concave Integer Quadratic Programming
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.