On the public citation graph

Programming, Games and Transportation Networks.

0 signed · 212 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 points at this work

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

inferred← citeshttps://doi.org/10.1002/0471667196.ess0476.pub2openalex-snapshot
Dendrites
inferred← citeshttps://doi.org/10.1002/nav.3800300202openalex-snapshot
Multiple resource leveling in construction systems through variation of activity intensities
inferred← citeshttps://doi.org/10.1002/net.3230010404openalex-snapshot
A generalized upper bounding algorithm for multicommodity network flow problems
inferred← citeshttps://doi.org/10.1002/net.3230060204openalex-snapshot
Hydraulic network analysis using (generalized) geometric programming
inferred← citeshttps://doi.org/10.1002/net.3230080107openalex-snapshot
Multicommodity network flows—A survey
inferred← citeshttps://doi.org/10.1002/net.3230130311openalex-snapshot
Stochastic bottleneck spanning tree problem
inferred← citeshttps://doi.org/10.1002/net.3230210606openalex-snapshot
Approximate solutions of capacitated fixed‐charge minimum cost network flow problems
inferred← citeshttps://doi.org/10.1006/jpdc.1999.1518openalex-snapshot
A Parallel Recursive Shortest Spanning Tree Algorithm for Image Segmentation in Distributed Computing Environment
inferred← citeshttps://doi.org/10.1007/3-540-10843-2_5openalex-snapshot
Minimum s-t cut of a planar undirected network in o(n log2(n)) time
inferred← citeshttps://doi.org/10.1007/3-540-36383-1_2openalex-snapshot
Visualization in Algorithm Engineering: Tools and Techniques
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_3openalex-snapshot
What Do We Learn from Experimental Algorithmics?
inferred← citeshttps://doi.org/10.1007/3-540-46135-3_40openalex-snapshot
Constraint Programming Contribution to Benders Decomposition: A Case Study
inferred← citeshttps://doi.org/10.1007/978-1-4471-2164-0_2openalex-snapshot
Principles of Shared Memory Parallel Programming Using ParC
inferred← citeshttps://doi.org/10.1007/978-1-4612-5427-0_23openalex-snapshot
Network Analysis of Steam Generator Flow
inferred← citeshttps://doi.org/10.1007/978-1-4612-5443-0_9openalex-snapshot
Traffic Equilibria on a Roadway Network
inferred← citeshttps://doi.org/10.1007/978-1-4614-4869-3_5openalex-snapshot
Monge–Kantorovich Mass Transference Problem, Minimal Distances and Minimal Norms
inferred← citeshttps://doi.org/10.1007/978-1-4614-4869-3_7openalex-snapshot
K -Minimal Metrics
inferred← citeshttps://doi.org/10.1007/978-1-4615-0843-4_2openalex-snapshot
Connectivity, Transitivity and Chromaticity: The Pioneering Work of Bernard Roy in Graph Theory
inferred← citeshttps://doi.org/10.1007/978-1-4615-3570-6_9openalex-snapshot
Interactive Floorplanning
inferred← citeshttps://doi.org/10.1007/978-1-4615-9558-8_9openalex-snapshot
Graph Theory
inferred← citeshttps://doi.org/10.1007/978-1-4684-1995-5_2openalex-snapshot
Interpretation of Complex Lithologic Successions by Substitutability Analysis
inferred← citeshttps://doi.org/10.1007/978-3-319-57315-1_6openalex-snapshot
F
inferred← citeshttps://doi.org/10.1007/978-3-642-13935-2_14openalex-snapshot
Stochastic Bottleneck Spanning Tree Problem on a Fuzzy Network
inferred← citeshttps://doi.org/10.1007/978-3-642-48123-9_3openalex-snapshot
Traffic Equilibria Analysed via Geometric Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-80784-8_22openalex-snapshot
On Project Cost-Duration Analysis Problem with Quadratic and Convex Cost Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-87729-2_8openalex-snapshot
Auswahl von theoriebezogenen Veröffentlichungen
inferred← citeshttps://doi.org/10.1007/978-81-322-2523-2_47openalex-snapshot
A Novel Solution of Dijkstra’s Algorithm for Shortest Path Routing with Polygonal Obstacles in Wireless Networks Using Fuzzy Mathematics
inferred← citeshttps://doi.org/10.1007/978-94-009-3253-1_11openalex-snapshot
Efficiency in Production and Consumption
inferred← citeshttps://doi.org/10.1007/bf00144259openalex-snapshot
Combinatorial procedures for structuring internal migration and other transaction flows
inferred← citeshttps://doi.org/10.1007/bf00934745openalex-snapshot
On the optimal mapping of distributions
inferred← citeshttps://doi.org/10.1007/bf01085015openalex-snapshot
Graph theory
inferred← citeshttps://doi.org/10.1007/bf01096681openalex-snapshot
Misclassification minimization
inferred← citeshttps://doi.org/10.1007/bf01240739openalex-snapshot
Algorithms and complexity analysis for some flow problems
inferred← citeshttps://doi.org/10.1007/bf01299142openalex-snapshot
The one-to-one shortest-path problem: An empirical analysis with the two-tree Dijkstra algorithm
inferred← citeshttps://doi.org/10.1007/bf01299449openalex-snapshot
Bilinear separation of two sets inn-space
inferred← citeshttps://doi.org/10.1007/bf01389214openalex-snapshot
Error estimates for MAC-like approximations to the linear Navier-Stokes equations
inferred← citeshttps://doi.org/10.1007/bf01584076openalex-snapshot
Some problems in discrete optimization
inferred← citeshttps://doi.org/10.1007/bf01874130openalex-snapshot
Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces
inferred← citeshttps://doi.org/10.1007/bf01917188openalex-snapshot
Ein Kapazitätsmodell für wissenschaftliche Hochschulen unter Einsatz von Netzwerkfluß- bzw. Transportverfahren
inferred← citeshttps://doi.org/10.1007/bf01949685openalex-snapshot
Ein Markieralgorithmus zur Lösung von allgemeinen Transportproblemen mit einem Bündel
inferred← citeshttps://doi.org/10.1007/bf02234055openalex-snapshot
Flüsse in antisymmetrischen Netzwerken
inferred← citeshttps://doi.org/10.1007/bf02242387openalex-snapshot
Normalformen planarer Graphen
inferred← citeshttps://doi.org/10.1007/bf02242388openalex-snapshot
Normalformen planarer Graphen
inferred← citeshttps://doi.org/10.1007/bf02252864openalex-snapshot
Anregungen aus dem Schnittebenenverfahren für die Lösung des allgemeinen Transportproblems
inferred← citeshttps://doi.org/10.1007/bf02510241openalex-snapshot
A greedy algorithm for the optimal basis problem
inferred← citeshttps://doi.org/10.1007/bf02773421openalex-snapshot
Explicit rational forms for the Poincaré series of the trace rings of generic matrices
inferred← citeshttps://doi.org/10.1007/bf02888777openalex-snapshot
An overview of semi-infinite programming theory and related topics through a generalization of the alternative theorems
inferred← citeshttps://doi.org/10.1007/bfb0028804openalex-snapshot
Parallel algorithms for connected components in a graph
inferred← citeshttps://doi.org/10.1007/bfb0030319openalex-snapshot
Finding a maximum flow in /s,t/-planar network in linear expected time
inferred← citeshttps://doi.org/10.1007/bfb0039596openalex-snapshot
Efficient graph algorithms using limited communication on a fixed-size array of processors
inferred← citeshttps://doi.org/10.1007/s00453-001-0061-3openalex-snapshot
Reconstructing a Minimum Spanning Tree after Deletion of Any Node
inferred← citeshttps://doi.org/10.1007/s10878-016-0070-4openalex-snapshot
A faster strongly polynomial time algorithm to solve the minimum cost tension problem
inferred← citeshttps://doi.org/10.1007/s10878-018-0331-5openalex-snapshot
An $$O(n(m+n\log n)\log n)$$O(n(m+nlogn)logn) time algorithm to solve the minimum cost tension problem
inferred← citeshttps://doi.org/10.1007/s11425-010-0075-xopenalex-snapshot
The existence theorem of absolute equilibrium about games on connected graph with state payoff vector
inferred← citeshttps://doi.org/10.1007/s11425-010-3075-yopenalex-snapshot
The existence theorem of absolute equilibrium about games on connected graph with state payoff vecto
inferred← citeshttps://doi.org/10.1007/s11590-016-1078-5openalex-snapshot
Approximation algorithms for constructing spanning K-trees using stock pieces of bounded length
inferred← citeshttps://doi.org/10.1007/s11750-012-0252-xopenalex-snapshot
Error minimization methods in biproportional apportionment
inferred← citeshttps://doi.org/10.1016/0020-0190(78)90039-xopenalex-snapshot
A probabilistic minimum spanning tree algorithm
inferred← citeshttps://doi.org/10.1016/0021-9045(76)90041-1openalex-snapshot
Some properties of Chebyshev approximation in a subspace of R
inferred← citeshttps://doi.org/10.1016/0021-9991(72)90028-9openalex-snapshot
Use of the simplex method in nonlinear programming for duct layout design
inferred← citeshttps://doi.org/10.1016/0021-9991(81)90206-0openalex-snapshot
An application of network' theory to the solution of implicit Navier-Stokes difference equations
inferred← citeshttps://doi.org/10.1016/0021-9991(91)90266-nopenalex-snapshot
Iterative solution of Navier-Stokes dual variable difference equations
inferred← citeshttps://doi.org/10.1016/0022-0000(80)90035-5openalex-snapshot
An O(EVIog2V) algorithm for the maximal flow problem
inferred← citeshttps://doi.org/10.1016/0022-247x(68)90201-1openalex-snapshot
Proper efficiency and the theory of vector maximization
inferred← citeshttps://doi.org/10.1016/0022-247x(69)90233-9openalex-snapshot
Maximum internally stable sets of a graph
inferred← citeshttps://doi.org/10.1016/0022-247x(70)90136-8openalex-snapshot
Solution to a class of convex programming problems via quasilinearization
inferred← citeshttps://doi.org/10.1016/0029-5493(94)90352-2openalex-snapshot
A network method for homogeneous, thermally expandable two-phase flow on unstructured triangular grids
inferred← citeshttps://doi.org/10.1016/0034-3331(73)90028-6openalex-snapshot
Simultaneous determination of visits to a system of outdoor recreation parks with capacity limitations
inferred← citeshttps://doi.org/10.1016/0038-0121(72)90020-1openalex-snapshot
An extremal and information-theoretic characterization of some interzonal transfer models
inferred← citeshttps://doi.org/10.1016/0097-8493(79)90014-1openalex-snapshot
Computer aided drafting with refresh graphics
inferred← citeshttps://doi.org/10.1016/0165-4896(92)90064-copenalex-snapshot
Cores of dense exchange economies
inferred← citeshttps://doi.org/10.1016/0166-3615(85)90045-4openalex-snapshot
A unified setting for various models of automated material flow and production systems
inferred← citeshttps://doi.org/10.1016/0167-6377(83)90063-9openalex-snapshot
Computational experience with minimum spanning tree algorithms
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90035-7openalex-snapshot
An efficient parallel algorithm for updating minimum spanning trees
inferred← citeshttps://doi.org/10.1016/0305-0548(83)90030-8openalex-snapshot
Routing and scheduling of vehicles and crews
inferred← citeshttps://doi.org/10.1016/0306-4549(84)90095-1openalex-snapshot
The minimization of uncertainties in reactor theory
inferred← citeshttps://doi.org/10.1016/0377-0427(94)90387-5openalex-snapshot
Mass-transshipment problems and ideal metrics
inferred← citeshttps://doi.org/10.1016/0377-2217(83)90158-3openalex-snapshot
A new algorithm for finding the shortest path between a specified pair of nodes in a graph of nonnegative arcs
inferred← citeshttps://doi.org/10.1016/0377-2217(92)90317-3openalex-snapshot
An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem
inferred← citeshttps://doi.org/10.1016/0377-2217(93)e0272-yopenalex-snapshot
A theorem on nonconvex functions and its application to vector optimization
inferred← citeshttps://doi.org/10.1016/0951-8320(93)90143-mopenalex-snapshot
Determination of minimal upper paths for reliability analysis of planar flow networks
inferred← citeshttps://doi.org/10.1016/b978-0-08-057184-3.50035-xopenalex-snapshot
GAMES OF PURE SKILL AND COMPETITIVE COMPUTERS
inferred← citeshttps://doi.org/10.1016/b978-0-12-780850-5.50055-1openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/j.artint.2017.05.004openalex-snapshot
MM: A bidirectional search algorithm that is guaranteed to meet in the middle
inferred← citeshttps://doi.org/10.1016/j.automatica.2008.12.015openalex-snapshot
Global target aggregation and state agreement of nonlinear multi-agent systems with switching topologies
inferred← citeshttps://doi.org/10.1016/j.automatica.2015.09.012openalex-snapshot
Convergence of max–min consensus algorithms
inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.10.002openalex-snapshot
The saga of minimum spanning trees
inferred← citeshttps://doi.org/10.1016/j.dam.2016.12.028openalex-snapshot
On minimum degree, leaf number, traceability and Hamiltonicity in graphs
inferred← citeshttps://doi.org/10.1016/j.laa.2009.02.034openalex-snapshot
Real rank versus nonnegative rank
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.12.038openalex-snapshot
The subdivision-constrained minimum spanning tree problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.03.042openalex-snapshot
An O(m(m+nlogn)log(nC)) -time algorithm to solve the minimum cost tension problem
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00185-9openalex-snapshot
A strongly polynomial algorithm for the minimum cost tension problem
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70830-6openalex-snapshot
Shortest Path and Network Flow Algorithms
inferred← citeshttps://doi.org/10.1016/s0169-7161(82)02015-xopenalex-snapshot
12 Single-link clustering algorithms
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00186-2openalex-snapshot
Penelope's graph: a hard minimum cost tension instance
inferred← citeshttps://doi.org/10.1016/s0377-0427(00)00385-xopenalex-snapshot
Penalized maximum-likelihood estimation, the Baum–Welch algorithm, diagonal balancing of symmetric matrices and applications to training acoustic data
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00523-4openalex-snapshot
Fuzzy random bottleneck spanning tree problems using possibility and necessity measures
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80118-5openalex-snapshot
Chapter 1 Applications of network optimization
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80126-4openalex-snapshot
Chapter 9 Optimal trees
inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01005-4openalex-snapshot
Chapter IV Network flows
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)66492-9openalex-snapshot
Optimization of urban and regional water supply systems
inferred← citeshttps://doi.org/10.1017/s0021900200042273openalex-snapshot
Regular stochastic matrices and digraphs
inferred← citeshttps://doi.org/10.1017/s0033583500000081openalex-snapshot
Network thermodynamics: dynamic modelling of biophysical systems
inferred← citeshttps://doi.org/10.1023/a:1019148501057openalex-snapshot
Large deviations of the steady-state distribution of reflected processes with applications to queueing systems
inferred← citeshttps://doi.org/10.1023/b:mach.0000033118.09057.80openalex-snapshot
Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces
inferred← citeshttps://doi.org/10.1029/wr009i005p01227openalex-snapshot
Algorithm for solving a class of linear programing problems related to reservoir management and design
inferred← citeshttps://doi.org/10.1063/1.522450openalex-snapshot
Surface scattering on topological networks
inferred← citeshttps://doi.org/10.1063/1.523077openalex-snapshot
Quantum mechanics on topological networks
inferred← citeshttps://doi.org/10.1068/a050519openalex-snapshot
Optimal Network Problem: A Branch-and-Bound Algorithm
inferred← citeshttps://doi.org/10.1068/a060565openalex-snapshot
Traffic Restraint as a Transport Planning Policy 1: A Framework for Analysis
inferred← citeshttps://doi.org/10.1068/a060675openalex-snapshot
Accessibility, Attraction, and Potential: A Review of Some Concepts and Their Use in Determining Mobility
inferred← citeshttps://doi.org/10.1068/a120321openalex-snapshot
An Application of Economic Interaction Models to the Analysis of Spatial Effects of Economic Integration
inferred← citeshttps://doi.org/10.1080/00207176808905629openalex-snapshot
Connection theorems in non-convex programming
inferred← citeshttps://doi.org/10.1080/00207728508926688openalex-snapshot
An economic equilibrium model on a multicommodity network
inferred← citeshttps://doi.org/10.1080/01603477.1991.11489868openalex-snapshot
Postmodernism and the Social Theory of Value
inferred← citeshttps://doi.org/10.1080/01630569108816452openalex-snapshot
Mass transhipment problems and ideal metrics
inferred← citeshttps://doi.org/10.1080/01630569508816639openalex-snapshot
An extension of the kantorovich-rubinstein mass-transshipment problem
inferred← citeshttps://doi.org/10.1080/02331937708842407openalex-snapshot
Quasikonkav-quasikonvexe spiele unter ausnutzung gegneriseker schwäcken und lexikographisehe optimierung1
inferred← citeshttps://doi.org/10.1080/02331939708844325openalex-snapshot
A Calculation of all Separating Hyperplanes of two Convex Polytopes
inferred← citeshttps://doi.org/10.1080/02331939808844377openalex-snapshot
On a calculation of an arbitrary separating hyperplane of convex polyhedral sets
inferred← citeshttps://doi.org/10.1080/02331939808844378openalex-snapshot
Separating support hyperplanes for a pair of convex polyhedral sets
inferred← citeshttps://doi.org/10.1080/03081079.2014.883712openalex-snapshot
Distributed estimation for adaptive sensor selection in wireless sensor networks
inferred← citeshttps://doi.org/10.1080/05695557308974917openalex-snapshot
An Algorithm for Project Cost-Duration Analysis Problem with Quadratic and Convex Cost Functions
inferred← citeshttps://doi.org/10.1080/10618569408904486openalex-snapshot
COVOLUME-DUAL VARIABLE METHOD FOR THERMALLY EXPANDABLE FLOW ON UNSTRUCTURED TRIANGULAR GRIDS
inferred← citeshttps://doi.org/10.1080/15326348508807015openalex-snapshot
Maximum flow in planar networks with exponentially distributed arc capacities
inferred← citeshttps://doi.org/10.1090/qam/449911openalex-snapshot
Network problems, 𝑀-functions and uniformly monotone networks
inferred← citeshttps://doi.org/10.1093/comjnl/12.3.267openalex-snapshot
Computer Evaluation of Mathematical Function
inferred← citeshttps://doi.org/10.1093/comjnl/12.3.268openalex-snapshot
Junction Optimisation Technique
inferred← citeshttps://doi.org/10.1108/03321641211200491openalex-snapshot
Computing optimal electronic and mathematical properties of Buckyball nanoparticle using graph algorithms
inferred← citeshttps://doi.org/10.1108/eb017507openalex-snapshot
SOLUTION OF INCOMPRESSIBLE NAVIER‐STOKES EQUATIONS ON UNSTRUCTURED GRIDS USING DUAL TESSELLATIONS
inferred← citeshttps://doi.org/10.1109/acc.2008.4586592openalex-snapshot
A discrete harmonic potential approach to motion planning on a weighted graph
inferred← citeshttps://doi.org/10.1109/acc.2011.5991292openalex-snapshot
Multi-agent systems reaching optimal consensus with directed communication graphs
inferred← citeshttps://doi.org/10.1109/acc.2012.6315361openalex-snapshot
Agreeing under randomized network dynamics
inferred← citeshttps://doi.org/10.1109/acc.2013.6580916openalex-snapshot
Convergence of distributed averaging and maximizing algorithms Part II: State-dependent graphs
inferred← citeshttps://doi.org/10.1109/access.2020.2977825openalex-snapshot
An Efficient Rectilinear and Octilinear Steiner Minimal Tree Algorithm for Multidimensional Environments
inferred← citeshttps://doi.org/10.1109/cdc.2005.1582905openalex-snapshot
Necessary and Sufficient Conditions for Reachability on a Simplex
inferred← citeshttps://doi.org/10.1109/cdc.2008.4739254openalex-snapshot
Set stability and coordination of nonlinear multi-agent systems with switching structure
inferred← citeshttps://doi.org/10.1109/cdc.2009.5399568openalex-snapshot
Distributed coordination of multi-agent systems with switching structure and input saturation
inferred← citeshttps://doi.org/10.1109/cdc.2011.6160957openalex-snapshot
Multi-agent robust consensus-Part I: Convergence analysis
inferred← citeshttps://doi.org/10.1109/cdc.2011.6160958openalex-snapshot
Multi-agent robust consensus-Part II: Application to distributed event-triggered coordination
inferred← citeshttps://doi.org/10.1109/cdc.2012.6426728openalex-snapshot
Persistent graphs and consensus convergence
inferred← citeshttps://doi.org/10.1109/cdc.2012.6426729openalex-snapshot
Randomized gossiping with unreliable communication: Dependent or independent node updates
inferred← citeshttps://doi.org/10.1109/icca.2010.5524228openalex-snapshot
Coordination of nonlinear multi-agent systems with multiple leaders and switching topologies
inferred← citeshttps://doi.org/10.1109/icca.2010.5524505openalex-snapshot
A distributed control approach to robust output regulation of networked linear systems
inferred← citeshttps://doi.org/10.1109/iros.2006.282218openalex-snapshot
A Discrete Harmonic Potential Field for Optimum Point-to-point Routing on a Weighted Graph
inferred← citeshttps://doi.org/10.1109/jsen.2011.2162092openalex-snapshot
Correlated Data Gathering With Double Trees in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tac.1985.1103925openalex-snapshot
A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing
inferred← citeshttps://doi.org/10.1109/tac.2010.2076250openalex-snapshot
A Distributed Control Approach to A Robust Output Regulation Problem for Multi-Agent Linear Systems
inferred← citeshttps://doi.org/10.1109/tc.1987.1676869openalex-snapshot
New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
inferred← citeshttps://doi.org/10.1109/tc.1987.1676928openalex-snapshot
Optimal Graph Algorithms on a Fixed-Size Linear Array
inferred← citeshttps://doi.org/10.1109/tcsvt.2004.828334openalex-snapshot
An Efficient Recursive Shortest Spanning Tree Algorithm Using Linking Properties
inferred← citeshttps://doi.org/10.1109/tct.1970.1083141openalex-snapshot
Proof in graph theory of the 'no gain' property of resistor networks
inferred← citeshttps://doi.org/10.1109/tct.1972.1083557openalex-snapshot
Driving-Point Synthesis of Resistor-Terminated Cascades Composed of Lumped Lossless Passive 2-ports and Commensurate TEM Lines
inferred← citeshttps://doi.org/10.1109/tct.1972.1083558openalex-snapshot
Basic constraints from graph theory for dc-to-dc conversion networks
inferred← citeshttps://doi.org/10.1109/tct.1973.1083752openalex-snapshot
On optimally sparse cycle and coboundary basis for a linear graph
inferred← citeshttps://doi.org/10.1109/tsp.2007.909377openalex-snapshot
Distributed Decision Through Self-Synchronizing Sensor Networks in the Presence of Propagation Delays and Asymmetric Channels
inferred← citeshttps://doi.org/10.1109/wicom.2009.5303273openalex-snapshot
BREAC: Broadcast Routing Based on Edmonds Algorithm for Ad Hoc Networks with Asymmetric Cost Model
inferred← citeshttps://doi.org/10.1111/j.1467-999x.1990.tb00469.xopenalex-snapshot
AN ARBITRAGE INTERPRETATION OF CLASSICAL OPTIMIZATION
inferred← citeshttps://doi.org/10.1137/0126030openalex-snapshot
Nonlinear Monotone Networks
inferred← citeshttps://doi.org/10.1137/0203021openalex-snapshot
Computationally Related Problems
inferred← citeshttps://doi.org/10.1137/050626405openalex-snapshot
State Agreement for Continuous‐Time Coupled Nonlinear Systems
inferred← citeshttps://doi.org/10.1145/301250.301367openalex-snapshot
Subquadratic approximation algorithms for clustering problems in high dimensional spaces
inferred← citeshttps://doi.org/10.1145/3188745.3188904openalex-snapshot
Holiest minimum-cost paths and flows in surface graphs
inferred← citeshttps://doi.org/10.1145/322092.322100openalex-snapshot
Two-Commodity Flow
inferred← citeshttps://doi.org/10.1145/355598.355600openalex-snapshot
Algorithm 396: Student's t-Quantiles
inferred← citeshttps://doi.org/10.1145/355598.362775openalex-snapshot
Algorithm 395: Students t -distribution
inferred← citeshttps://doi.org/10.1145/358628.358650openalex-snapshot
Efficient parallel algorithms for some graph problems
inferred← citeshttps://doi.org/10.1145/361604.361628openalex-snapshot
Algorithm 487: Exact cumulative distribution of the Kolmorgorov-Smirnov statistic for small samples
inferred← citeshttps://doi.org/10.1145/361604.361629openalex-snapshot
Algorithm 488: A Gaussian pseudo-random number generator
inferred← citeshttps://doi.org/10.1145/361604.361630openalex-snapshot
Remark on Algorithm 420: Hidden-Line Plotting Program [J6]
inferred← citeshttps://doi.org/10.1145/361604.361631openalex-snapshot
Remark on Algorithm 426: Generation of Random Correlated Normal Variables [G5]
inferred← citeshttps://doi.org/10.1145/361604.361632openalex-snapshot
Remark on Algorithm 456: Routing Problem [G5]
inferred← citeshttps://doi.org/10.1145/362342.362365openalex-snapshot
Algorithm 456: routing problem
inferred← citeshttps://doi.org/10.1145/569961.569966openalex-snapshot
Computing minimum spanning trees efficiently
inferred← citeshttps://doi.org/10.1145/800057.808699openalex-snapshot
Fast expected-time and approximation algorithms for geometric minimum spanning trees
inferred← citeshttps://doi.org/10.1145/800133.804326openalex-snapshot
Combinatorial optimization with rational objective functions
inferred← citeshttps://doi.org/10.1145/800135.804394openalex-snapshot
Network flow and generalized path compression
inferred← citeshttps://doi.org/10.1145/800153.804934openalex-snapshot
A high quality, low cost router for MOS/LSI
inferred← citeshttps://doi.org/10.1145/800167.805404openalex-snapshot
Design automation and the WRAP System
inferred← citeshttps://doi.org/10.1145/800193.569966openalex-snapshot
Computing minimum spanning trees efficiently
inferred← citeshttps://doi.org/10.1177/002072096900700108openalex-snapshot
Comments on Phasors and Phasor Diagrams
inferred← citeshttps://doi.org/10.1287/moor.4.4.414openalex-snapshot
Combinatorial Optimization with Rational Objective Functions
inferred← citeshttps://doi.org/10.1287/moor.5.1.1openalex-snapshot
Combinatorial Optimization: What is the State of the Art
inferred← citeshttps://doi.org/10.1287/opre.17.4.583openalex-snapshot
Shortest Paths in Probabilistic Graphs
inferred← citeshttps://doi.org/10.1287/opre.21.1.225openalex-snapshot
An Algorithm for Globally-Optimal Nonlinear-Cost Multidimensional Flows in Networks and Some Special Applications
inferred← citeshttps://doi.org/10.1287/opre.21.1.305openalex-snapshot
Some Properties of Generalized Concave Functions
inferred← citeshttps://doi.org/10.1287/opre.23.6.1091openalex-snapshot
Optimization Problems Subject to a Budget Constraint with Economies of Scale
inferred← citeshttps://doi.org/10.1287/trsc.5.3.232openalex-snapshot
Scheduling and Fleet Routing Models for Transportation Systems
inferred← citeshttps://doi.org/10.1533/9780857099570.1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1533/9780857099570.104openalex-snapshot
Minimum-Cost Feasible-Flow
inferred← citeshttps://doi.org/10.1533/9780857099570.11openalex-snapshot
Trees
inferred← citeshttps://doi.org/10.1533/9780857099570.129openalex-snapshot
Matching and Assignment
inferred← citeshttps://doi.org/10.1533/9780857099570.150openalex-snapshot
Postman Problems
inferred← citeshttps://doi.org/10.1533/9780857099570.169openalex-snapshot
Travelling Salesperson
inferred← citeshttps://doi.org/10.1533/9780857099570.183openalex-snapshot
Tutorial hints
inferred← citeshttps://doi.org/10.1533/9780857099570.27openalex-snapshot
Shortest Paths
inferred← citeshttps://doi.org/10.1533/9780857099570.46openalex-snapshot
Maximum Flows
inferred← citeshttps://doi.org/10.1533/9780857099570.63openalex-snapshot
How to Store a Network
inferred← citeshttps://doi.org/10.1533/9780857099570.73openalex-snapshot
More about Shortest Paths
inferred← citeshttps://doi.org/10.1533/9780857099570.90openalex-snapshot
Advanced Maximal Flow
showing the first 200 of 212 · page through all 212
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.