On the public citation graph
Combinatorial algorithms for inverse network flow problems
0 signed · 93 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.1007/978-3-642-59179-2_8openalex-snapshot
The inverse shortest paths problem with upper bounds on shortest paths costs
inferredcites →https://doi.org/10.1007/bf01432364openalex-snapshot
A column generation method for inverse shortest path problems
inferredcites →https://doi.org/10.1007/bf01582056openalex-snapshot
On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
inferredcites →https://doi.org/10.1007/bf01582238openalex-snapshot
Efficient dual simplex algorithms for the assignment problem
inferredcites →https://doi.org/10.1007/bf01585693openalex-snapshot
On an instance of the inverse shortest paths problem
inferredcites →https://doi.org/10.1007/bf01586040openalex-snapshot
New scaling algorithms for the assignment and minimum mean cycle problems
inferredcites →https://doi.org/10.1007/bf02614370openalex-snapshot
How to compute least infeasible flows
inferredcites →https://doi.org/10.1007/bf03167381openalex-snapshot
An inverse problem of the weighted shortest path problem
inferredcites →https://doi.org/10.1016/0012-365x(78)90011-0openalex-snapshot
A characterization of the minimum cycle mean in a digraph
inferredcites →https://doi.org/10.1016/0166-218x(81)90026-3openalex-snapshot
Parametric shortest path algorithms with an application to cyclic staffing
inferredcites →https://doi.org/10.1016/0377-0427(95)00277-4openalex-snapshot
Calculating some inverse linear programming problems
inferredcites →https://doi.org/10.1080/02331939708844306openalex-snapshot
Inverse maximum flow and minimum cut problems
inferredcites →https://doi.org/10.1109/sfcs.1984.715934openalex-snapshot
Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms
inferredcites →https://doi.org/10.1137/0218069openalex-snapshot
Faster Scaling Algorithms for Network Problems
inferredcites →https://doi.org/10.1137/s0097539792231179openalex-snapshot
Scaling Algorithms for the Shortest Paths Problem
inferredcites →https://doi.org/10.1137/s0097539794263695openalex-snapshot
Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
inferredcites →https://doi.org/10.1142/9789814354363_0016openalex-snapshot
Parametric Flows, Weighted Means of Cuts, and Fractional Combinatorial Optimization
inferredcites →https://doi.org/10.1145/12130.12144openalex-snapshot
A new approach to the maximum flow problem
inferredcites →https://doi.org/10.1145/290179.290181openalex-snapshot
Beyond the flow decomposition barrier
inferredcites →https://doi.org/10.1145/48014.61051openalex-snapshot
A new approach to the maximum-flow problem
inferredcites →https://doi.org/10.1145/96559.96597openalex-snapshot
Convex separable optimization is not much harder than linear optimization
inferredcites →https://doi.org/10.1287/moor.4.4.414openalex-snapshot
Combinatorial Optimization with Rational Objective Functions
inferredcites →https://doi.org/10.2307/2583863openalex-snapshot
Network Flows: Theory, Algorithms, and Applications.
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.20163openalex-snapshot
Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
inferred← citeshttps://doi.org/10.1006/jagm.1999.1052openalex-snapshot
A Faster Algorithm for the Inverse Spanning Tree Problem
inferred← citeshttps://doi.org/10.1007/11496199_45openalex-snapshot
Inverse Problems of Some NP-Complete Problems
inferred← citeshttps://doi.org/10.1007/978-3-032-13116-4_1openalex-snapshot
Inverse Optimization in Finite-State Continuous-Time Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/978-3-319-49580-4_15openalex-snapshot
Inverse Multicast Quality of Service Routing Problem with Bandwidth and Delay Under the Weighted $$l_1$$ Norm
inferred← citeshttps://doi.org/10.1007/978-3-540-77903-2_2openalex-snapshot
Routing and Capacity Optimization for IP Networks
inferred← citeshttps://doi.org/10.1007/978-981-95-4770-8_13openalex-snapshot
Delineating New Bus Lines in Monterrey, Mexico
inferred← citeshttps://doi.org/10.1007/s00186-010-0323-4openalex-snapshot
A Perturbation approach for an inverse quadratic programming problem
inferred← citeshttps://doi.org/10.1007/s00186-026-00924-8openalex-snapshot
A combinatorial algorithm for inverse continuous quadratic knapsack problem
inferred← citeshttps://doi.org/10.1007/s00245-009-9075-zopenalex-snapshot
An Augmented Lagrangian Method for a Class of Inverse Quadratic Programming Problems
inferred← citeshttps://doi.org/10.1007/s10100-014-0367-2openalex-snapshot
Inverse eccentric vertex problem on networks
inferred← citeshttps://doi.org/10.1007/s10479-017-2420-8openalex-snapshot
Inverse multiple criteria sorting problem
inferred← citeshttps://doi.org/10.1007/s10479-020-03651-3openalex-snapshot
The inverse connected p-median problem on block graphs under various cost functions
inferred← citeshttps://doi.org/10.1007/s10589-009-9294-xopenalex-snapshot
Inverse problems and solution methods for a class of nonlinear complementarity problems
inferred← citeshttps://doi.org/10.1007/s10729-022-09599-zopenalex-snapshot
Inverse optimization on hierarchical networks: an application to breast cancer clinical pathways
inferred← citeshttps://doi.org/10.1007/s10878-008-9159-8openalex-snapshot
Capacity inverse minimum cost flow problem
inferred← citeshttps://doi.org/10.1007/s10898-025-01529-xopenalex-snapshot
Solution methods for partial inverse combinatorial optimization problems in which weights can only be increased
inferred← citeshttps://doi.org/10.1007/s11425-010-3129-1openalex-snapshot
The inverse maximum dynamic flow problem
inferred← citeshttps://doi.org/10.1007/s11590-024-02183-0openalex-snapshot
Newton-type algorithms for inverse optimization: weighted bottleneck Hamming distance and $$\ell _\infty$$-norm objectives
inferred← citeshttps://doi.org/10.1007/s11590-026-02283-zopenalex-snapshot
An SAA approach for solving a class of stochastic linear semidefinite inverse optimal value problems
inferred← citeshttps://doi.org/10.1007/s11750-011-0227-3openalex-snapshot
The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones
inferred← citeshttps://doi.org/10.1007/s12597-023-00718-0openalex-snapshot
An enhanced Benders decomposition method for unique shortest path routing
inferred← citeshttps://doi.org/10.1007/s13042-012-0138-0openalex-snapshot
Design of a kind of nonlinear neural networks for solving the inverse optimal value problem with convex constraints
inferred← citeshttps://doi.org/10.1016/j.amc.2021.126328openalex-snapshot
The minmax regret inverse maximum weight problem
inferred← citeshttps://doi.org/10.1016/j.apnum.2024.02.004openalex-snapshot
A penalty-type method for solving inverse optimal value problem in second-order conic programming
inferred← citeshttps://doi.org/10.1016/j.cam.2008.01.028openalex-snapshot
A smoothing Newton method for a type of inverse semi-definite quadratic programming problem
inferred← citeshttps://doi.org/10.1016/j.cam.2020.112838openalex-snapshot
Inverse semidefinite quadratic programming problem with l1 norm measure
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106681openalex-snapshot
Inverse optimization in semi-definite programs to impute unknown constraint matrices
inferred← citeshttps://doi.org/10.1016/j.dam.2015.12.017openalex-snapshot
On inverse linear programming problems under the bottleneck-type weighted Hamming distance
inferred← citeshttps://doi.org/10.1016/j.dam.2017.06.002openalex-snapshot
Inverse minimum flow problem under the weighted sum-type Hamming distance
inferred← citeshttps://doi.org/10.1016/j.disopt.2013.03.001openalex-snapshot
The inverse {0,1} -knapsack problem: Theory, algorithms and computational experiments
inferred← citeshttps://doi.org/10.1016/j.disopt.2026.100957openalex-snapshot
The inverse 1-median problem on median graphs under l2-norm
inferred← citeshttps://doi.org/10.1016/j.ejor.2009.01.043openalex-snapshot
Inverse optimization for linearly constrained convex separable programming problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.03.031openalex-snapshot
An inverse optimization approach for a capacitated vehicle routing problem
inferred← citeshttps://doi.org/10.1016/j.jksus.2023.102825openalex-snapshot
A bibliometric analysis of inverse optimization
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.08.010openalex-snapshot
Computational aspects of the inverse single facility location problem on trees under l-norm
inferred← citeshttps://doi.org/10.1023/b:joco.0000038914.26975.9bopenalex-snapshot
Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results
inferred← citeshttps://doi.org/10.1051/ro/2017088openalex-snapshot
Reverse maximum flow problem under the weighted Chebyshev distance
inferred← citeshttps://doi.org/10.1051/ro:2001106openalex-snapshot
Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem
inferred← citeshttps://doi.org/10.1051/ro:2008017openalex-snapshot
The inverse maximum flow problem consideringl∞norm
inferred← citeshttps://doi.org/10.1057/s41274-016-0144-9openalex-snapshot
An origin-based model for unique shortest path routing
inferred← citeshttps://doi.org/10.1080/00207160903513003openalex-snapshot
A perturbation approach for a type of inverse linear programming problems
inferred← citeshttps://doi.org/10.1080/02331934.2019.1576663openalex-snapshot
A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems
inferred← citeshttps://doi.org/10.1109/access.2020.3045288openalex-snapshot
Inverse Maximum Capacity Path Problems Under Sum-Type and Max-Type Distances and Their Practical Application to Transportation Networks
inferred← citeshttps://doi.org/10.1109/access.2025.3586099openalex-snapshot
Smart Data and Decision Support System for Local Optimization of Electric Charging Stations
inferred← citeshttps://doi.org/10.1109/icnc.2010.5582992openalex-snapshot
An inverse optimization method for production planning
inferred← citeshttps://doi.org/10.1111/risa.13420openalex-snapshot
Identification of Protective Actions to Reduce the Vulnerability of Safety‐Critical Systems to Malevolent Intentional Acts: An Optimization‐Based Decision‐Making Approach
inferred← citeshttps://doi.org/10.1142/s0217595916500251openalex-snapshot
A Sequential Convex Program Approach to an Inverse Linear Semidefinite Programming Problem
inferred← citeshttps://doi.org/10.1142/s0217595919500180openalex-snapshot
Maximum Capacity Path Interdiction Problem with Fixed Costs
inferred← citeshttps://doi.org/10.1142/s0217595921500019openalex-snapshot
Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks
inferred← citeshttps://doi.org/10.12677/aam.2026.151013openalex-snapshot
On Solvability and Complexity for a Class of Inverse Gauge Optimal Value Problems
inferred← citeshttps://doi.org/10.12677/aam.2026.152059openalex-snapshot
An Algorithm of Nonlinear Inverse Optimization
inferred← citeshttps://doi.org/10.1287/mnsc.2021.4100openalex-snapshot
An Inverse Optimization Approach to Measuring Clinical Pathway Concordance
inferred← citeshttps://doi.org/10.1287/opre.1080.0606openalex-snapshot
OR FORUM—Catching the “Network Science” Bug: Insight and Opportunity for the Operations Researcher
inferred← citeshttps://doi.org/10.21597/jist.440137openalex-snapshot
Karayolları Bakım Çalışmasında Kullanılan Araçların Güzergâhlarının Hiyerarşik Çinli Postacı Problemi Kullanılarak Düzenlenmesi
inferred← citeshttps://doi.org/10.2298/fil2104333nopenalex-snapshot
The reverse total weighted distance problem on networks with variable edge lengths
inferred← citeshttps://doi.org/10.2298/yjor220516037nopenalex-snapshot
The inverse k-max combinatorial optimization problem
inferred← citeshttps://doi.org/10.3390/math7100899openalex-snapshot
Inverse Generalized Maximum Flow Problems
inferred← citeshttps://doi.org/10.3390/math8091494openalex-snapshot
Inverse Minimum Cut Problem with Lower and Upper Bounds
inferred← citeshttps://doi.org/10.3923/itj.2012.713.718openalex-snapshot
Applications of the General Nonlinear Neural Networks in Solving the Inverse Optimal Value Problem with Linear Constraints
inferred← citeshttps://doi.org/10.3934/jimo.2013.9.171openalex-snapshot
A perturbation approach for an inverse linear second-order cone programming
inferred← citeshttps://doi.org/10.3934/jimo.2014.10.965openalex-snapshot
A majorized penalty approach to inverse linear second order cone programming problems
inferred← citeshttps://doi.org/10.3934/jimo.2016.12.317openalex-snapshot
An alternating direction method for solving a class of inverse semi-definite quadratic programming problems
inferred← citeshttps://doi.org/10.4018/ijncr.2014100103openalex-snapshot
A Genetic Algorithms Approach for Inverse Shortest Path Length Problems
inferred← citeshttps://doi.org/10.4304/jnw.5.10.1169-1176openalex-snapshot
An Efficient Algorithm for Reverse 2-median Problem on A Cycle
inferred← citeshttps://doi.org/10.59167/tujnas.v3i3.1284openalex-snapshot
Inverse Linear Goal Programming Problem
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.