On the public citation graph
Multiflots de coût minimal avec fonctions de coût concaves
0 signed · 59 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.3800080104openalex-snapshot
Fixed‐cost transportation problems
inferredcites →https://doi.org/10.1002/net.3230010205openalex-snapshot
Minimum cost routing for static network models
inferredcites →https://doi.org/10.1002/net.3230030404openalex-snapshot
On building minimum cost communication networks
inferredcites →https://doi.org/10.1002/net.3230040104openalex-snapshot
On building minimum cost communication networks over time
inferredcites →https://doi.org/10.1002/zamm.19600400516openalex-snapshot
C. Berge, Théorie des graphes et ses applications. VIII + 277 S. m. 117 Abb. Paris 1958. Dunod Editeur. Preis geb. 3400 F
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_5openalex-snapshot
An Automatic Method for Solving Discrete Programming Problems
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bf02995808openalex-snapshot
Multiflots Dynamiques de Cout Actualisé Minimal
inferredcites →https://doi.org/10.1007/bf02995852openalex-snapshot
Planification a court et a moyen terme d’un réseau de télécommunications
inferredcites →https://doi.org/10.1007/bf02996582openalex-snapshot
Recherche de la configuration optimale d’un réseau de télécommunications avec fonctions de coût concaves (fin)
inferredcites →https://doi.org/10.1007/bf02997742openalex-snapshot
Recherche de la configuration optimale d’un réseau de télécommunications avec fonctions de coût concaves
inferredcites →https://doi.org/10.1007/bf03028824openalex-snapshot
Résolution des programmes linéaires a variables mixtes par la procédure S.E.P.
inferredcites →https://doi.org/10.1016/0005-1098(69)90010-7openalex-snapshot
Traffic flow information for minimum cost routing procedures
inferredcites →https://doi.org/10.1016/0041-1647(69)90152-xopenalex-snapshot
The optimal network problem: Some computational procedures
inferredcites →https://doi.org/10.1051/m2an/197105r100031openalex-snapshot
Tour d'horizon : programmation non linéaire
inferredcites →https://doi.org/10.1051/ro/197307v100531openalex-snapshot
Variations sur un algorithme de DANTZIG : application à la recherche des plus courts chemins dans les grands réseaux
inferredcites →https://doi.org/10.1080/00207177208932320openalex-snapshot
On the fixed cost flow problem†
inferredcites →https://doi.org/10.1080/00401706.1965.10490283openalex-snapshot
Nonlinear and Dynamic Programming
inferredcites →https://doi.org/10.1109/proc.1972.8551openalex-snapshot
The design of large-scale networks
inferredcites →https://doi.org/10.1109/tsmc.1971.4308301openalex-snapshot
Optimization Theory of Large Systems
inferredcites →https://doi.org/10.1145/321707.321712openalex-snapshot
Finding the Lengths of All Shortest paths in N -Node Nonnegative-Distance Complete Networks Using ½ N 3 Additions and N 3 Comparisons
inferredcites →https://doi.org/10.1287/mnsc.14.7.429openalex-snapshot
Minimum Concave Cost Flows in Certain Networks
inferredcites →https://doi.org/10.1287/opre.14.1.45openalex-snapshot
Minimum-Cost Multicommodity Network Flows
inferredcites →https://doi.org/10.1287/opre.19.1.156openalex-snapshot
The One-Terminal TELPAK Problem
inferredcites →https://doi.org/10.1287/opre.19.6.1529openalex-snapshot
Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
inferredcites →https://doi.org/10.1287/opre.21.5.1142openalex-snapshot
The Group-Theoretic Structure in the Fixed-Charge Transportation Problem
inferredcites →https://doi.org/10.1287/trsc.7.1.49openalex-snapshot
Network Design with Fixed and Variable Cost Elements
inferredcites →https://doi.org/10.1515/9781400884179openalex-snapshot
Linear Programming and Extensions
inferredcites →https://doi.org/10.2307/1910129openalex-snapshot
An Automatic Method of Solving Discrete Programming Problems
inferredcites →https://doi.org/10.2307/2033241openalex-snapshot
On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem
inferredcites →https://doi.org/10.2307/2343701openalex-snapshot
Nonlinear Programming: A Unified Approach.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/j.1538-7305.1989.tb00320.xopenalex-snapshot
An Algorithm for Designing Survivable Networks
inferred← citeshttps://doi.org/10.1002/net.3230190305openalex-snapshot
Networks synthesis and optimum network design problems: Models, solution methods and applications
inferred← citeshttps://doi.org/10.1002/net.3230230205openalex-snapshot
Shortest paths, single origin‐destination network design, and associated polyhedra
inferred← citeshttps://doi.org/10.1007/978-0-387-30165-5_7openalex-snapshot
Multicommodity Network Flow Models and Algorithms in Telecommunications
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-3400-2_12openalex-snapshot
Parallel Continuous Non-Convex Optimization
inferred← citeshttps://doi.org/10.1007/bf00130828openalex-snapshot
Global search algorithms for minimum concave-cost network flow problems
inferred← citeshttps://doi.org/10.1007/bf01720158openalex-snapshot
OFELIE — Eine Methode zur Iangfristigen Planung von Fernmeldenetzen
inferred← citeshttps://doi.org/10.1007/bf02024487openalex-snapshot
Parallel computing in nonconvex programming
inferred← citeshttps://doi.org/10.1007/bf02110041openalex-snapshot
Proximal decomposition for multicommodity flow problems with convex costs
inferred← citeshttps://doi.org/10.1007/bfb0006528openalex-snapshot
Accelerated greedy algorithms for maximizing submodular set functions
inferred← citeshttps://doi.org/10.1007/s11235-008-9068-2openalex-snapshot
Minimum concave cost multicommodity network design
inferred← citeshttps://doi.org/10.1016/0169-7552(86)90052-8openalex-snapshot
Grade of service and optimization of distributed packet-switched networks
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73239-0openalex-snapshot
Network Synthesis and Dynamic Network Optimization
inferred← citeshttps://doi.org/10.1023/a:1016231031814openalex-snapshot
A Concavity Result for Network Design Problems
inferred← citeshttps://doi.org/10.1051/lhb/1988002openalex-snapshot
Renforcement optimum des réseaux d'adduction d'eau potable en zone rurale. Méthodes d'avant-projet
inferred← citeshttps://doi.org/10.1051/ro/1984180302471openalex-snapshot
Diamètre de graphes et qualité de service d'un réseau de données
inferred← citeshttps://doi.org/10.1057/jors.1996.143openalex-snapshot
Enhanced Adjacent Extreme-point Search and Tabu Search for the Minimum Concave-cost Uncapacitated Transshipment Problem
inferred← citeshttps://doi.org/10.1201/9781420028683.ch7openalex-snapshot
Parallel Computing in Global Optimization
inferred← citeshttps://doi.org/10.1287/opre.51.2.228.12786openalex-snapshot
An Oil Pipeline Design Problem
inferred← citeshttps://doi.org/10.1590/0101-7438.2017.037.03.0571openalex-snapshot
MULTICOMMODITY NETWORK FLOWS WITH NONCONVEX ARC COSTS
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.