On the public citation graph
Shortest paths in networks with vector weights
0 signed · 100 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/net.1975.5.3.299openalex-snapshot
GRAPH THEORY WITH APPLICATIONS TO ENGINEERING AND COMPUTER SCIENCE
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1016/0022-247x(68)90201-1openalex-snapshot
Proper efficiency and the theory of vector maximization
inferredcites →https://doi.org/10.1057/jors.1970.122openalex-snapshot
Integer Programming and Network Flows.
inferredcites →https://doi.org/10.1109/proc.1975.9996openalex-snapshot
Graph theory with applications to engineering and computer science
inferredcites →https://doi.org/10.1109/tsmc.1973.4309290openalex-snapshot
Graph Theory with Engineering Applications
inferredcites →https://doi.org/10.1137/0212039openalex-snapshot
A Shortest-Path Algorithm with Expected Time $O(n^2 \log n\log ^ * n)$
inferredcites →https://doi.org/10.1177/058310247700900109openalex-snapshot
Book Reviews : FINITE ELEMENT ANALYSIS FUNDAMENTALS R.H. Gallagher Prentice Hall, Inc., Englewood Cliffs, New Jersey (1975)
inferredcites →https://doi.org/10.1287/mnsc.6.2.187openalex-snapshot
On the Shortest Route Through a Network
inferredcites →https://doi.org/10.1287/opre.17.3.395openalex-snapshot
An Appraisal of Some Shortest-Path Algorithms
inferredcites →https://doi.org/10.1287/opre.24.6.1164openalex-snapshot
Technical Note—Shortest-Path Algorithms: A Comparison
inferredcites →https://doi.org/10.1287/opre.27.1.161openalex-snapshot
Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
inferredcites →https://doi.org/10.2307/3008450openalex-snapshot
Integer Programming and Network Flows.
inferredcites →https://doi.org/10.6028/nbs.tn.772openalex-snapshot
A performance comparison of labeling algorithms for calculating shortest path trees
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1520-6750(200002)47:1<57::aid-nav4>3.0.co;2-4openalex-snapshot
Dynamic programming approaches to the multiple criteria knapsack problem
inferred← citeshttps://doi.org/10.1002/net.21815openalex-snapshot
Extensions of labeling algorithms for multi‐objective uncertain shortest path problems
inferred← citeshttps://doi.org/10.1006/jmaa.1993.1067openalex-snapshot
Time Dependency in Multiple Objective Dynamic Programming
inferred← citeshttps://doi.org/10.1007/0-306-48107-3_8openalex-snapshot
Multiobjective Combinatorial Optimization — Theory, Methodology, and Applications
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_326openalex-snapshot
Multiple Objective Dynamic Programming
inferred← citeshttps://doi.org/10.1007/11940128_40openalex-snapshot
Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_430openalex-snapshot
Multiple Objective Dynamic Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-55911-7_39openalex-snapshot
The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization
inferred← citeshttps://doi.org/10.1007/978-3-540-72792-7_5openalex-snapshot
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-59132-7_48openalex-snapshot
A Tchebycheff Metric Approach to the Optimal Path Problem with Nonlinear Multiattribute Cost Functions
inferred← citeshttps://doi.org/10.1007/978-3-7908-1812-3_10openalex-snapshot
Multiple Objective Path Optimization for Time Dependent Objective Functions
inferred← citeshttps://doi.org/10.1007/bf00939418openalex-snapshot
An organizing principle for dynamic estimation
inferred← citeshttps://doi.org/10.1007/bf03398701openalex-snapshot
New Algorithms For Multi Objective Shortest Path Problem
inferred← citeshttps://doi.org/10.1007/s00006-015-0595-0openalex-snapshot
Generalized Zeon Algebras: Theory and Application to Multi-Constrained Path Problems
inferred← citeshttps://doi.org/10.1007/s00224-007-9096-4openalex-snapshot
Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-Linear Objectives with Applications
inferred← citeshttps://doi.org/10.1007/s10107-022-01885-6openalex-snapshot
The smoothed number of Pareto-optimal solutions in bicriteria integer optimization
inferred← citeshttps://doi.org/10.1007/s10209-023-00981-4openalex-snapshot
A graph model and a three-stage algorithm to aid the physically disabled with navigation
inferred← citeshttps://doi.org/10.1007/s11042-016-4015-9openalex-snapshot
Multimedia application to an extended public transportation network in South Korea: optimal path search in a multimodal transit network
inferred← citeshttps://doi.org/10.1007/s12597-012-0111-4openalex-snapshot
A new algorithm to compute pareto-optimal paths in a multi objective fuzzy weighted network
inferred← citeshttps://doi.org/10.1007/s12652-017-0601-6openalex-snapshot
Multi-criteria shortest path for rough graph
inferred← citeshttps://doi.org/10.1016/0041-5553(89)90055-4openalex-snapshot
On some algorithmic problems of multicriterion optimization on graphs
inferred← citeshttps://doi.org/10.1016/0096-3003(93)90060-ropenalex-snapshot
Routing with nonlinear multiattribute cost functions
inferred← citeshttps://doi.org/10.1016/0191-2615(95)00020-8openalex-snapshot
Towards a new definition of topological accessibility
inferred← citeshttps://doi.org/10.1016/0377-2217(92)90248-8openalex-snapshot
A multicriteria Pareto-optimal path algorithm
inferred← citeshttps://doi.org/10.1016/0377-2217(93)90140-iopenalex-snapshot
Multiobjective transportation network design and routing problems: Taxonomy and annotation
inferred← citeshttps://doi.org/10.1016/0377-2217(93)90142-aopenalex-snapshot
Multiobjective routing of hazardous materials in stochastic networks
inferred← citeshttps://doi.org/10.1016/j.comnet.2008.09.014openalex-snapshot
Inter-domain policy violations in multi-hop overlay routes: Analysis and mitigation
inferred← citeshttps://doi.org/10.1016/j.cor.2008.02.002openalex-snapshot
A comparison of solution strategies for biobjective shortest path problems
inferred← citeshttps://doi.org/10.1016/j.disopt.2006.05.006openalex-snapshot
Algorithms for time-dependent bicriteria shortest path problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2004.12.003openalex-snapshot
Multicriteria adaptive paths in stochastic, time-varying networks
inferred← citeshttps://doi.org/10.1016/j.ejor.2008.09.036openalex-snapshot
The tricriterion shortest path problem with at least two bottleneck objective functions
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.05.002openalex-snapshot
Labeling methods for partially ordered paths
inferred← citeshttps://doi.org/10.1016/j.eswa.2016.10.045openalex-snapshot
Many-objective stochastic path finding using reinforcement learning
inferred← citeshttps://doi.org/10.1016/j.eswa.2016.12.009openalex-snapshot
An advanced GA–VNS combination for multicriteria route planning in public transit networks
inferred← citeshttps://doi.org/10.1016/j.sbspro.2013.05.034openalex-snapshot
Adaptive Vehicle Routing for Risk-averse Travelers
inferred← citeshttps://doi.org/10.1016/j.trb.2012.03.005openalex-snapshot
Parametric search and problem decomposition for approximating Pareto-optimal paths
inferred← citeshttps://doi.org/10.1016/j.trc.2013.06.015openalex-snapshot
Adaptive vehicle routing for risk-averse travelers
inferred← citeshttps://doi.org/10.1016/j.trc.2018.09.011openalex-snapshot
Data-driven stochastic transit assignment modeling using an automatic fare collection system
inferred← citeshttps://doi.org/10.1016/j.trpro.2014.10.027openalex-snapshot
A Multi-objective Time-dependent Route Planner: A Real World Application to Milano City
inferred← citeshttps://doi.org/10.1016/s0377-2217(01)00188-6openalex-snapshot
Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80092-1openalex-snapshot
Chapter 11 Siting of hazardous facilities
inferred← citeshttps://doi.org/10.1017/9781108637435.020openalex-snapshot
Smoothed Analysis of Pareto Curves in Multiobjective Optimization
inferred← citeshttps://doi.org/10.1023/a:1021737819929openalex-snapshot
Modified Algorithm to Compute Pareto-Optimal Vectors
inferred← citeshttps://doi.org/10.1051/ro:2003001openalex-snapshot
A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set
inferred← citeshttps://doi.org/10.1080/00207160412331296715openalex-snapshot
New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems
inferred← citeshttps://doi.org/10.1080/02331939108843732openalex-snapshot
Complexity of vector optimization problems on graphs
inferred← citeshttps://doi.org/10.1080/03610928408828756openalex-snapshot
Multivariate order statistics
inferred← citeshttps://doi.org/10.1080/10556788.2014.907290openalex-snapshot
The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks
inferred← citeshttps://doi.org/10.1109/access.2019.2926675openalex-snapshot
A Stochastic Approach Towards Travel Route Optimization and Recommendation Based on Users Constraints Using Markov Chain
inferred← citeshttps://doi.org/10.1109/focs.2009.21openalex-snapshot
Smoothed Analysis of Multiobjective Optimization
inferred← citeshttps://doi.org/10.1109/iciea.2015.7334374openalex-snapshot
Artificial intelligence aided recommendation based mobile trip planner for Eskisehir city
inferred← citeshttps://doi.org/10.1109/icnp.2006.320219openalex-snapshot
Characterizing and Mitigating Inter-domain Policy Violations in Overlay Routes
inferred← citeshttps://doi.org/10.1109/icsmc.1992.271684openalex-snapshot
Transient behavior in multiple criteria path planning problems
inferred← citeshttps://doi.org/10.1109/icsmc.1992.271685openalex-snapshot
Approximation in time dependent multiple objective path planning
inferred← citeshttps://doi.org/10.1109/tac.1985.1103871openalex-snapshot
Some multiple objective dynamic programs
inferred← citeshttps://doi.org/10.1109/tcyb.2025.3535544openalex-snapshot
Exploring a Favorable Tradeoff for Finding Every Efficient Path in Large-Scale Networks
inferred← citeshttps://doi.org/10.1111/j.1475-3995.2011.00815.xopenalex-snapshot
Multicriteria path and tree problems: discussion on exact algorithms and applications
inferred← citeshttps://doi.org/10.1142/s0218213018600126openalex-snapshot
Computing Multicriteria Shortest Paths in Stochastic Multimodal Networks Using a Memetic Algorithm
inferred← citeshttps://doi.org/10.1145/2213977.2214016openalex-snapshot
Improved smoothed analysis of multiobjective optimization
inferred← citeshttps://doi.org/10.1145/2699445openalex-snapshot
Improved Smoothed Analysis of Multiobjective Optimization
inferred← citeshttps://doi.org/10.1145/2746285.2746301openalex-snapshot
An Operator Calculus Approach for Multi-constrained Routing in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1177/0361198105192300115openalex-snapshot
Adjustable Preference Path Strategies for Use in Multicriteria, Stochastic, and Time-Varying Transportation Networks
inferred← citeshttps://doi.org/10.13140/rg.2.1.2092.5289openalex-snapshot
Bartering integer commodities with exogenous prices
inferred← citeshttps://doi.org/10.1515/amcs-2017-0010openalex-snapshot
A Relation of Dominance for the Bicriterion Bus Routing Problem
inferred← citeshttps://doi.org/10.15388/informatica.2013.406openalex-snapshot
A Label Correcting Algorithm with Storing Partial Solutions to Solving the Bus Routing Problem
inferred← citeshttps://doi.org/10.21936/si2011_v32.n4a.213openalex-snapshot
Rozwiązanie problemu wyznaczania połączeń w sieciach komunikacyjnych z zastosowaniem metody skalaryzacji
inferred← citeshttps://doi.org/10.21936/si2011_v32.n4a.214openalex-snapshot
Algorytmy optymalizacji tras przejazdu pojazdów
inferred← citeshttps://doi.org/10.21936/si2012_v33.n4.93openalex-snapshot
Algorytm wyznaczania połączenia komunikacyjnego o minimalnym czasie przejazdu z dodatkową minimalizacją kosztu przejazdu
inferred← citeshttps://doi.org/10.2478/v10006-007-0023-2openalex-snapshot
Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
inferred← citeshttps://doi.org/10.3233/fi-2012-716openalex-snapshot
A Label Correcting Algorithm for the Bus Routing Problem
inferred← citeshttps://doi.org/10.3390/a17060222openalex-snapshot
Multiobjective Path Problems and Algorithms in Telecommunication Network Design—Overview and Trends
inferred← citeshttps://doi.org/10.3390/math10060930openalex-snapshot
Multicriteria Optimization Problem on Prefractal Graph
inferred← citeshttps://doi.org/10.3390/math12050624openalex-snapshot
Designing Ecotourism Routes with Time-Dependent Benefits along Arcs and Waiting Times at Nodes
inferred← citeshttps://doi.org/10.3923/tasr.2015.278.285openalex-snapshot
K-Objective Time-Varying Shortest Path Problem with Zero Waiting Times at Vertices
inferred← citeshttps://doi.org/10.48550/arxiv.1111.1546openalex-snapshot
Improved Smoothed Analysis of Multiobjective Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.2103.08327openalex-snapshot
Some Network Optimization Models under Diverse Uncertain Environments
inferred← citeshttps://doi.org/10.53846/goediss-6852openalex-snapshot
Solution Methods for Multi-Objective Robust Combinatorial Optimization
inferred← citeshttps://doi.org/10.61186/jist.36842.11.43.260openalex-snapshot
Trip Timing Algorithm for GTFS Data with Redis Model to Improve the Performance
inferred← citeshttps://doi.org/10.70675/14fdc3cczbed6z41afza63dzfa2a3f1af42copenalex-snapshot
Optimisation des routes maritimes : un système de résolution multicritère et dépendant du temps
inferred← citeshttps://doi.org/10.70675/7e23523dz3e32z4fc3zada4z1a6238dd466copenalex-snapshot
Multi-constrained QoS Routing and Energy Optimization for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.70675/db694dc8z9f80z448ez8b47z3094fc33800dopenalex-snapshot
Vehicle Routing Problems with road-network information
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.