On the public citation graph

The relax codes for linear minimum cost network flow problems

https://doi.org/10.1007/bf02288322
0 signed · 99 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01584237openalex-snapshot
A new algorithm for the assignment problem
inferredcites →https://doi.org/10.1007/bf01585734openalex-snapshot
Relaxation methods for monotropic programs
inferredcites →https://doi.org/10.1007/bf01586087openalex-snapshot
A unified framework for primal-dual methods in minimum cost network flow problems
inferredcites →https://doi.org/10.1007/bf02592017openalex-snapshot
Relaxation methods for problems with strictly convex separable costs and linear constraints
inferredcites →https://doi.org/10.1016/b978-0-12-141050-6.50014-3openalex-snapshot
OPTIMIZATION FOR SPARSE SYSTEMS
inferredcites →https://doi.org/10.1016/s1474-6670(17)55135-6openalex-snapshot
Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems
inferredcites →https://doi.org/10.1057/jors.1981.81openalex-snapshot
Algorithms for Network Programming
inferredcites →https://doi.org/10.1109/cdc.1986.267433openalex-snapshot
Distributed relaxation methods for linear network flow problems
inferredcites →https://doi.org/10.1137/0325006openalex-snapshot
Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
inferredcites →https://doi.org/10.1137/0325067openalex-snapshot
Relaxation Methods for Network Flow Problems with Convex Arc Costs
inferredcites →https://doi.org/10.1287/mnsc.20.5.814openalex-snapshot
NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
inferredcites →https://doi.org/10.1287/moor.12.4.569openalex-snapshot
Relaxation Methods for Linear Programs
inferredcites →https://doi.org/10.1287/opre.36.1.93openalex-snapshot
Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
inferredcites →https://doi.org/10.21236/ada148027openalex-snapshot
Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9780471703778.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/net.3230220407openalex-snapshot
Cell suppression: Disclosure protection for sensitive tabular data
inferred← citeshttps://doi.org/10.1007/3-540-26942-8_4openalex-snapshot
LP mit spezieller Struktur
inferred← citeshttps://doi.org/10.1007/978-1-4419-1213-8_13openalex-snapshot
Matching in R
inferred← citeshttps://doi.org/10.1007/978-1-4419-1213-8_8openalex-snapshot
Basic Tools of Multivariate Matching
inferred← citeshttps://doi.org/10.1007/978-1-4757-6075-0_4openalex-snapshot
Transportation-Oriented Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-46405-9_14openalex-snapshot
Matching in R
inferred← citeshttps://doi.org/10.1007/978-3-030-46405-9_9openalex-snapshot
Basic Tools of Multivariate Matching
inferred← citeshttps://doi.org/10.1007/978-3-031-90494-3_5openalex-snapshot
Algorithms for Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-70950-3_4openalex-snapshot
LP mit spezieller Struktur
inferred← citeshttps://doi.org/10.1007/978-3-642-18112-2_4openalex-snapshot
LP mit spezieller Struktur
inferred← citeshttps://doi.org/10.1007/978-3-642-59179-2_14openalex-snapshot
An Efficient Implementation of the Network Simplex Method
inferred← citeshttps://doi.org/10.1007/978-3-642-59179-2_16openalex-snapshot
NETSPEAK: An Algebraic Modelling Language for Nonconvex Network Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-80117-4_12openalex-snapshot
A Lagrangean Heuristic for the Facility Location Problem with Staircase Costs
inferred← citeshttps://doi.org/10.1007/978-3-662-06910-3_4openalex-snapshot
Lineare Optimierungsprobleme mit spezieller Struktur
inferred← citeshttps://doi.org/10.1007/978-3-662-06911-0_4openalex-snapshot
Lineare Optimierungsprobleme mit spezieller Struktur
inferred← citeshttps://doi.org/10.1007/978-3-662-06912-7_4openalex-snapshot
Lineare Optimierungsprobleme mit spezieller Struktur
inferred← citeshttps://doi.org/10.1007/978-3-662-06913-4_4openalex-snapshot
Lineare Optimierungsprobleme mit spezieller Struktur
inferred← citeshttps://doi.org/10.1007/978-3-662-21852-5_4openalex-snapshot
LP mit spezieller Struktur
inferred← citeshttps://doi.org/10.1007/978-3-662-48216-2_4openalex-snapshot
Lineare Optimierungsprobleme mit spezieller Struktur
inferred← citeshttps://doi.org/10.1007/978-3-662-48230-8_4openalex-snapshot
LP mit spezieller Struktur
inferred← citeshttps://doi.org/10.1007/978-94-011-0924-6_18openalex-snapshot
The Diameter of Polytopes and Related Applications
inferred← citeshttps://doi.org/10.1007/bf01299450openalex-snapshot
A generic auction algorithm for the minimum cost network flow problem
inferred← citeshttps://doi.org/10.1007/bf01300860openalex-snapshot
Efficient decomposition and linearization methods for the stochastic transportation problem
inferred← citeshttps://doi.org/10.1007/bf01415527openalex-snapshot
The quickest flow problem
inferred← citeshttps://doi.org/10.1007/bf01720353openalex-snapshot
A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints
inferred← citeshttps://doi.org/10.1007/bf02022563openalex-snapshot
Large-scale controlled rounding using tabu search with strategic oscillation
inferred← citeshttps://doi.org/10.1007/bf02192042openalex-snapshot
An auction algorithm for the max-flow problem
inferred← citeshttps://doi.org/10.1007/bf02216923openalex-snapshot
The auction algorithm for the transportation problem
inferred← citeshttps://doi.org/10.1007/bf02247962openalex-snapshot
ε-Optimality for bicriteria programs and its application to minimum cost flows
inferred← citeshttps://doi.org/10.1007/s10479-011-0858-7openalex-snapshot
A least-squares minimum-cost network flow algorithm
inferred← citeshttps://doi.org/10.1007/s10852-010-9129-xopenalex-snapshot
Updating Network Flows Given Multiple, Heterogeneous Arc Attribute Changes
inferred← citeshttps://doi.org/10.1007/s11269-012-0129-7openalex-snapshot
A Model for Solving the Optimal Water Allocation Problem in River Basins with Network Flow Programming When Introducing Non-Linearities
inferred← citeshttps://doi.org/10.1016/0167-9473(93)90242-lopenalex-snapshot
Sharp bounds for the maximum of the chi-square index in a class of contingency tables with given marginals
inferred← citeshttps://doi.org/10.1016/0377-2217(94)00200-2openalex-snapshot
Conditional subgradient optimization — Theory and applications
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90184-8openalex-snapshot
Solving the staircase cost facility location problem with decomposition and piecewise linearization
inferred← citeshttps://doi.org/10.1016/0893-9659(95)00108-5openalex-snapshot
Infinite networks: Minimal cost flows
inferred← citeshttps://doi.org/10.1016/b978-0-12-812362-1.00001-1openalex-snapshot
Concepts and methodologies for agricultural water management
inferred← citeshttps://doi.org/10.1016/j.ijepes.2009.09.009openalex-snapshot
Tracing the flows of electricity
inferred← citeshttps://doi.org/10.1016/s0038-0121(96)00016-xopenalex-snapshot
Political district determination using large-scale network optimization
inferred← citeshttps://doi.org/10.1016/s0038-0121(96)00024-9openalex-snapshot
A fast algorithm for large-scale controlled rounding of 3-dimensional census tables
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00120-0openalex-snapshot
The k-cardinality assignment problem
inferred← citeshttps://doi.org/10.1016/s0167-9236(96)00040-1openalex-snapshot
BLOOMS: A prototype modeling language with object oriented features
inferred← citeshttps://doi.org/10.1016/s0305-0548(02)00046-1openalex-snapshot
A cutting plane algorithm for the capacitated arc routing problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00058-6openalex-snapshot
A Lagrangean heuristic for the facility location problem with staircase costs
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00085-9openalex-snapshot
A combined transportation and scheduling problem
inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01005-4openalex-snapshot
Chapter IV Network flows
inferred← citeshttps://doi.org/10.1023/a:1007964732399openalex-snapshot
Optimal Flow Allocation in the Zambezi River System
inferred← citeshttps://doi.org/10.1057/jors.1996.115openalex-snapshot
Optimization-based Distribution Planning for Consumer Electronic Items
inferred← citeshttps://doi.org/10.1080/00207160600848017openalex-snapshot
Experiments with a hybrid interior point/combinatorial approach for network flow problems
inferred← citeshttps://doi.org/10.1080/01621459.2021.1981337openalex-snapshot
Matching One Sample According to Two Criteria in Observational Studies
inferred← citeshttps://doi.org/10.1080/09720529.2008.10698167openalex-snapshot
The lane covering problem with time windows
inferred← citeshttps://doi.org/10.1080/10556788.2014.895828openalex-snapshot
Minimum-cost flow algorithms: an experimental evaluation
inferred← citeshttps://doi.org/10.1080/10618600.2016.1152971openalex-snapshot
Imposing Minimax and Quantile Constraints on Optimal Matching in Observational Studies
inferred← citeshttps://doi.org/10.1109/36.868877openalex-snapshot
Probabilistic cost functions for network flow phase unwrapping
inferred← citeshttps://doi.org/10.1109/7.53448openalex-snapshot
Efficient algorithms for finding the K best paths through a trellis
inferred← citeshttps://doi.org/10.1109/cacsd.1994.288935openalex-snapshot
An extension of a CACSD package for network analysis: Metanet
inferred← citeshttps://doi.org/10.1109/icassp.2014.6853716openalex-snapshot
Max-min network flow and resource allocation for backhaul constrained heterogeneous wireless networks
inferred← citeshttps://doi.org/10.1109/icif.2006.301634openalex-snapshot
Multi-Target Viterbi Data Association
inferred← citeshttps://doi.org/10.1109/iecon.1992.254485openalex-snapshot
A planning method combining rule-bases and optimization algorithms for transportation network
inferred← citeshttps://doi.org/10.1109/igarss.1998.702806openalex-snapshot
Unwrapping large interferograms using the minimum cost flow algorithm
inferred← citeshttps://doi.org/10.1109/igarss.1999.772009openalex-snapshot
Probabilistic cost functions for network flow phase unwrapping
inferred← citeshttps://doi.org/10.1109/igarss.2000.861693openalex-snapshot
Multiresolution network flow phase unwrapping
inferred← citeshttps://doi.org/10.1109/jsac.2014.2328171openalex-snapshot
Min Flow Rate Maximization for Software Defined Radio Access Networks
inferred← citeshttps://doi.org/10.1109/pica.1995.515162openalex-snapshot
A mew model for the optimization of the power system at Imatran Voima
inferred← citeshttps://doi.org/10.1109/taes.2010.5461643openalex-snapshot
Multihypothesis Viterbi Data Association: Algorithm Development and Assessment
inferred← citeshttps://doi.org/10.1109/tgrs.2002.800279openalex-snapshot
Hierarchical network flow phase unwrapping
inferred← citeshttps://doi.org/10.1109/tgrs.2015.2430619openalex-snapshot
Multichannel Phase Unwrapping: Problem Topology and Dual-Level Parallel Computational Model
inferred← citeshttps://doi.org/10.1109/tpds.2022.3155713openalex-snapshot
Efficient Flow-Based Scheduling for Geo-Distributed Simulation Tasks in Collaborative Edge and Cloud Environments
inferred← citeshttps://doi.org/10.1111/biom.13098openalex-snapshot
Directional Penalties for Optimal Matching in Observational Studies
inferred← citeshttps://doi.org/10.1137/0803013openalex-snapshot
Reverse Auction and the Solution of Inequality Constrained Assignment Problems
inferred← citeshttps://doi.org/10.1146/annurev-statistics-031219-041058openalex-snapshot
Modern Algorithms for Matching in Observational Studies
inferred← citeshttps://doi.org/10.11606/d.18.2003.tde-16012005-005752openalex-snapshot
Alternativas de transporte rodo-marítimo na distribuição de cargas frigoríficas no Brasil
inferred← citeshttps://doi.org/10.1214/19-sts699openalex-snapshot
Matching Methods for Observational Studies Derived from Large Administrative Databases
inferred← citeshttps://doi.org/10.1214/24-aoas1949openalex-snapshot
A new design for observational studies applied to the study of the effects of high school football on cognition late in life
inferred← citeshttps://doi.org/10.1287/ijoc.1040.0081openalex-snapshot
A Computational Study of Cost Reoptimization for Min-Cost Flow Problems
inferred← citeshttps://doi.org/10.1287/mnsc.41.1.83openalex-snapshot
A Min Cost Flow Solution for Dynamic Assignment Problems in Networks with Storage Devices
inferred← citeshttps://doi.org/10.1287/trsc.29.1.4openalex-snapshot
The Airline Exception Scheduling Problem
inferred← citeshttps://doi.org/10.15476/elte.2019.029openalex-snapshot
Efficient Algorithms for Graph Optimization Problems
inferred← citeshttps://doi.org/10.3233/inf-2001-12203openalex-snapshot
The Method for Solving a Piecewise-Linear Multicommodity Flow Problem
inferred← citeshttps://doi.org/10.32614/cran.package.tightenblockopenalex-snapshot
tightenBlock: Tightens an Observational Block Design by Balanced Subset Matching
inferred← citeshttps://doi.org/10.4995/thesis/10251/45996openalex-snapshot
Methodology for the optimal management design of water resources system under hydrologic uncertainty
inferred← citeshttps://doi.org/10.5270/fringe2015.pp308openalex-snapshot
A Parallel Computational Model for Multichannel Phase Unwrapping Problem
inferred← citeshttps://doi.org/10.5555/3026877.3026886openalex-snapshot
Firmament: fast, centralized cluster scheduling at scale
inferred← citeshttps://doi.org/10.5772/61847openalex-snapshot
Topological Characterization and Advanced Noise-Filtering Techniques for Phase Unwrapping of Interferometric Data Stacks
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.