On the public citation graph
Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
0 signed · 79 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/nav.3800070103openalex-snapshot
A postscript to “Dynamic problems in the theory of the firm”
inferredcites →https://doi.org/10.1002/nav.3800160311openalex-snapshot
An approximative algorithm for the fixed charge problem
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/bf02283688openalex-snapshot
Minimum concave-cost network flow problems: Applications, complexity, and algorithms
inferredcites →https://doi.org/10.1007/bfb0000035openalex-snapshot
Constrained Global Optimization: Algorithms and Applications
inferredcites →https://doi.org/10.1016/0167-6377(88)90049-1openalex-snapshot
Checking local optimality in constrained quadratic programming is NP-hard
inferredcites →https://doi.org/10.1016/0304-3975(86)90135-0openalex-snapshot
NP is as easy as detecting unique solutions
inferredcites →https://doi.org/10.1145/22145.22196openalex-snapshot
NP is as easy as detecting unique solutions
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.13.1.105openalex-snapshot
A Deterministic Multi-Period Production Scheduling Model with Backlogging
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.22.5.587openalex-snapshot
A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge 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.1515/9781400884179openalex-snapshot
Linear Programming and Extensions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1520-6750(199512)42:8<1141::aid-nav3220420803>3.0.co;2-bopenalex-snapshot
Facility location and capacity acquisition: An integrated approach
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.10076openalex-snapshot
Upper bounds for single‐source uncapacitated concave minimum‐cost network flow problems
inferred← citeshttps://doi.org/10.1002/net.20167openalex-snapshot
Heuristic solutions for general concave minimum cost network flow problems
inferred← citeshttps://doi.org/10.1002/net.3230230208openalex-snapshot
A polynomial time solvable concave network flow problem
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_335openalex-snapshot
Nonconvex Network Flow Problems
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_443openalex-snapshot
Nonconvex Network Flow Problems
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-4419-1665-5_10openalex-snapshot
Greedy Randomized Adaptive Search Procedures: Advances, Hybridizations, and Applications
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-4613-0239-1_9openalex-snapshot
Solving Large Scale Fixed Charge 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/978-1-4615-1507-4_15openalex-snapshot
Grasp: An Annotated Bibliography
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/978-3-030-54621-2_443-1openalex-snapshot
Nonconvex Network Flow Problems
inferred← citeshttps://doi.org/10.1007/bf00130828openalex-snapshot
Global search algorithms for minimum concave-cost network flow problems
inferred← citeshttps://doi.org/10.1007/bf01096764openalex-snapshot
The Minimum Concave Cost Network Flow Problem with fixed numbers of sources and nonlinear arc costs
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/bf01545530openalex-snapshot
An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks
inferred← citeshttps://doi.org/10.1007/bf02283688openalex-snapshot
Minimum concave-cost network flow problems: Applications, complexity, and algorithms
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/s11081-021-09621-3openalex-snapshot
Scalable algorithms for designing CO2 capture and storage infrastructure
inferred← citeshttps://doi.org/10.1016/j.asoc.2019.105951openalex-snapshot
Probabilistic tree-based representation for solving minimum cost integer flow problems with nonlinear non-convex cost functions
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.ijpe.2010.01.007openalex-snapshot
The economic lot-sizing problem with remanufacturing and one-way substitution
inferred← citeshttps://doi.org/10.1016/j.ijpe.2014.06.003openalex-snapshot
Note on “The economic lot-sizing problem with remanufacturing and one-way substitution”
inferred← citeshttps://doi.org/10.1016/j.mathsocsci.2009.01.002openalex-snapshot
Network flow problems and permutationally concave games
inferred← citeshttps://doi.org/10.1016/j.orl.2011.02.005openalex-snapshot
Single-path routing of stochastic flows in networks
inferred← citeshttps://doi.org/10.1016/j.trb.2004.07.001openalex-snapshot
Optimal location of intermodal freight hubs
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:1008379621400openalex-snapshot
Linear Approximations in a Dynamic Programming Approach for the Uncapacitated Single-Source Minimum Concave Cost Network Flow Problem in Acyclic Networks
inferred← citeshttps://doi.org/10.1023/a:1016231031814openalex-snapshot
A Concavity Result for Network Design Problems
inferred← citeshttps://doi.org/10.1080/02331939308843882openalex-snapshot
Strongly polynomial algorithm for a production-transportation problem with concave production cost
inferred← citeshttps://doi.org/10.1080/02331939508844033openalex-snapshot
Strongly polynomial algorithm for two special minimum concave cost network flow problems
inferred← citeshttps://doi.org/10.1109/glocom.2002.1189174openalex-snapshot
Configuration of reserved delivery subnetworks
inferred← citeshttps://doi.org/10.1109/glocom.2010.5685231openalex-snapshot
Performance-Oriented Routing in Telecommunication Networks
inferred← citeshttps://doi.org/10.1109/iwqos.2014.6914300openalex-snapshot
Online resource scheduling under concave pricing for cloud computing
inferred← citeshttps://doi.org/10.1109/tnet.2005.863711openalex-snapshot
Network correlated data gathering with explicit communication: NP-completeness and algorithms
inferred← citeshttps://doi.org/10.1109/tpds.2015.2432799openalex-snapshot
Online Resource Scheduling Under Concave Pricing for Cloud Computing
inferred← citeshttps://doi.org/10.1109/wcica.2018.8630372openalex-snapshot
A Solution Approach to the Nonconvex Piecewise Linear Network Flow Problems
inferred← citeshttps://doi.org/10.1137/18m121873xopenalex-snapshot
Subdeterminants and Concave Integer Quadratic Programming
inferred← citeshttps://doi.org/10.1142/9789812798190_0009openalex-snapshot
A Method for Solving Network Flow Problems with General Nonlinear Arc Costs
inferred← citeshttps://doi.org/10.1142/s0129183124501201openalex-snapshot
Heuristic optimal transport in branching networks
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.1145/2684066openalex-snapshot
Top-k and Clustering with Noisy Comparisons
inferred← citeshttps://doi.org/10.1145/3192975.3192978openalex-snapshot
Objective Variation Network Simplex Algorithm for Concave Continuous Piecewise Linear Network Flow Problems
inferred← citeshttps://doi.org/10.1287/trsc.2020.0978openalex-snapshot
Intermodal Hinterland Network Design Games
inferred← citeshttps://doi.org/10.48550/arxiv.1712.10197openalex-snapshot
Interesting Paths in the Mapper
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.71781/21103openalex-snapshot
Production externalities : cooperative and non-cooperative approaches
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
showing the first 57 of 58 · page through all 58
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.