On the public citation graph
A Parallel Computing Framework for Finding the Supported Solutions to a Biobjective Network Optimization Problem
0 signed · 45 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-319-07959-2_10openalex-snapshot
Parallel Bi-objective Shortest Paths Using Weight-Balanced B-trees with Bulk Updates
inferredcites →https://doi.org/10.1007/978-3-642-60972-5_27openalex-snapshot
Overview of Scheduling and Planning of Batch Process Operations
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bf02592101openalex-snapshot
Shortest paths algorithms: Theory and experimental evaluation
inferredcites →https://doi.org/10.1007/s10732-008-9070-6openalex-snapshot
Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network
inferredcites →https://doi.org/10.1016/0191-2615(79)90024-9openalex-snapshot
A model and algorithm for multicriteria route-mode choice
inferredcites →https://doi.org/10.1016/0305-0548(90)90042-6openalex-snapshot
An interactive approach to identify the best compromise solution for two objective shortest path problems
inferredcites →https://doi.org/10.1016/j.biocon.2004.05.019openalex-snapshot
Selection of bioclimatically representative biological reserve systems under climate change
inferredcites →https://doi.org/10.1016/j.cor.2006.02.023openalex-snapshot
Computing all efficient solutions of the biobjective minimum spanning tree problem
inferredcites →https://doi.org/10.1016/j.cor.2008.02.002openalex-snapshot
A comparison of solution strategies for biobjective shortest path problems
inferredcites →https://doi.org/10.1016/j.ejor.2005.09.033openalex-snapshot
Multiple objective minimum cost flow problems: A review
inferredcites →https://doi.org/10.1016/j.ejor.2006.12.054openalex-snapshot
Two phase algorithms for the bi-objective assignment problem
inferredcites →https://doi.org/10.1016/j.energy.2011.11.028openalex-snapshot
Optimal power flow solutions through multi-objective programming
inferredcites →https://doi.org/10.1029/2009wr008121openalex-snapshot
Managing population and drought risks using many‐objective water portfolio planning under uncertainty
inferredcites →https://doi.org/10.1029/wr015i005p01001openalex-snapshot
Generating multiobjective trade‐offs: An algorithm for bicriterion problems
inferredcites →https://doi.org/10.1061/(asce)0733-947x(1985)111:2(114)openalex-snapshot
Transmission Corridor Location Modeling
inferredcites →https://doi.org/10.1068/a090727openalex-snapshot
An Evaluation of Lattice Solutions to the Problem of Corridor Location
inferredcites →https://doi.org/10.1093/forestscience/49.4.555openalex-snapshot
Clustering and Compactness in Reserve Site Selection: An Extension of the Biodiversity Management Area Selection Model
inferredcites →https://doi.org/10.1108/09600039310038161openalex-snapshot
Supplier Selection Using Multi‐objective Programming: A Decision Support System Approach
inferredcites →https://doi.org/10.1109/ipdps.2013.89openalex-snapshot
Parallel Label-Setting Multi-objective Shortest Path Search
inferredcites →https://doi.org/10.1109/jproc.1998.658762openalex-snapshot
Cramming More Components Onto Integrated Circuits
inferredcites →https://doi.org/10.1111/j.1475-3995.2011.00815.xopenalex-snapshot
Multicriteria path and tree problems: discussion on exact algorithms and applications
inferredcites →https://doi.org/10.1111/j.1540-5915.1982.tb00126.xopenalex-snapshot
STRATEGIC FACILITY PLANNING: THE ANALYSIS OF OPTIONS
inferredcites →https://doi.org/10.1137/1.9781611973075.79openalex-snapshot
How good is the Chord algorithm?
inferredcites →https://doi.org/10.1145/1465482.1465560openalex-snapshot
Validity of the single processor approach to achieving large scale computing capabilities
inferredcites →https://doi.org/10.1177/0160017613507772openalex-snapshot
Corridor Location for Infrastructure Development
inferredcites →https://doi.org/10.1287/ijoc.1060.0191openalex-snapshot
Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
inferredcites →https://doi.org/10.1287/ijoc.1090.0342openalex-snapshot
A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
inferredcites →https://doi.org/10.1287/inte.6.4.102openalex-snapshot
Some Simple-Minded Observations on the Role of Optimization in Public Systems Decision-Making
inferredcites →https://doi.org/10.1287/mnsc.25.1.73openalex-snapshot
Bicriteria Transportation Problem
inferredcites →https://doi.org/10.2478/v10006-007-0023-2openalex-snapshot
Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/mcda.70024openalex-snapshot
On Supportedness in Multi‐Objective Integer Linear Programming
inferred← citeshttps://doi.org/10.1007/978-3-031-97635-3_36openalex-snapshot
SOPMOA*: Unleashing Shared-Open Parallelism for High-Performance Multi-Objective Pathfinding
inferred← citeshttps://doi.org/10.1007/978-3-319-99846-6_10openalex-snapshot
Coverage of Network-Based Structures: Paths, Tours and Trees
inferred← citeshttps://doi.org/10.1016/j.cor.2017.01.004openalex-snapshot
Finding extreme supported solutions of biobjective network flow problems: An enhanced parametric programming approach
inferred← citeshttps://doi.org/10.1016/j.orhc.2018.04.001openalex-snapshot
Supporting healthy route choice for commuter cyclists: The trade-off between travel time and pollutant dose
inferred← citeshttps://doi.org/10.1080/1573062x.2023.2218339openalex-snapshot
Sewer network design methodology for low-cost, resilient, and reliable designs
inferred← citeshttps://doi.org/10.1109/cesys.2016.7889909openalex-snapshot
Network power planning model analysis for large-scale transmission expansion based on mathematical optimization theory
inferred← citeshttps://doi.org/10.1145/3486970openalex-snapshot
COVID-19 and Minimizing Micro-Spatial Interactions
inferred← citeshttps://doi.org/10.1371/journal.pone.0250106openalex-snapshot
Effects of raster terrain representation on GIS shortest path analysis
inferred← citeshttps://doi.org/10.1609/socs.v17i1.31560openalex-snapshot
Efficient Set Dominance Checks in Multi-Objective Shortest-Path Algorithms via Vectorized Operations
inferred← citeshttps://doi.org/10.24963/ijcai.2023/757openalex-snapshot
Heuristic-Search Approaches for the Multi-Objective Shortest-Path Problem: Progress and Research Opportunities
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.