On the public citation graph

A Decomposition Framework for Bi-Objective Travelling Salesman Problems with Profits

https://doi.org/10.2139/ssrn.7403131
0 signed · 22 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.1002/net.20033openalex-snapshot
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
inferredcites →https://doi.org/10.1002/net.21469openalex-snapshot
Balancing profits and costs on trees
inferredcites →https://doi.org/10.1007/s00453-025-01314-yopenalex-snapshot
Pareto Sums of Pareto Sets: Lower Bounds and Algorithms
inferredcites →https://doi.org/10.1007/s10589-016-9850-0openalex-snapshot
An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices
inferredcites →https://doi.org/10.1007/s10589-017-9924-7openalex-snapshot
Decomposition methods based on articulation vertices for degree-dependent spanning tree problems
inferredcites →https://doi.org/10.1007/s10852-008-9080-2openalex-snapshot
Multi-objective Meta-heuristics for the Traveling Salesman Problem with Profits
inferredcites →https://doi.org/10.1016/j.cor.2013.02.011openalex-snapshot
Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
inferredcites →https://doi.org/10.1016/j.cor.2023.106506openalex-snapshot
Efficient dominance filtering for unions and Minkowski sums of non-dominated sets
inferredcites →https://doi.org/10.1016/j.ejor.2003.10.003openalex-snapshot
The biobjective travelling purchaser problem
inferredcites →https://doi.org/10.1016/j.ejor.2007.12.014openalex-snapshot
An exact -constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits
inferredcites →https://doi.org/10.1016/j.ejor.2016.12.017openalex-snapshot
The Traveling Purchaser Problem and its variants
inferredcites →https://doi.org/10.1016/j.ejor.2025.07.005openalex-snapshot
Generator sets for the Minkowski sum problem
inferredcites →https://doi.org/10.1016/j.tcs.2014.02.046openalex-snapshot
Complexity and approximation for Traveling Salesman Problems with profits
inferredcites →https://doi.org/10.1068/b150447openalex-snapshot
The Multiobjective Vending Problem: A Generalization of the Travelling Salesman Problem
inferredcites →https://doi.org/10.1109/tits.2018.2808179openalex-snapshot
An Improved Augmented $\varepsilon$ -Constraint and Branch-and-Cut Method to Solve the TSP With Profits
inferredcites →https://doi.org/10.1111/itor.13407openalex-snapshot
The multiobjective traveling salesman–repairman problem with profits: design and implementation of a variable neighborhood descent algorithm for a real scenario
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/1.9781611973402.131openalex-snapshot
A subexponential parameterized algorithm for Subset TSP on planar graphs
inferredcites →https://doi.org/10.1137/1.9781611973594.ch10openalex-snapshot
Chapter 10: Vehicle Routing Problems with Profits
inferredcites →https://doi.org/10.1145/367766.368168openalex-snapshot
Algorithm 97: Shortest path
inferredcites →https://doi.org/10.1287/ijoc.10.2.133openalex-snapshot
Solving the Orienteering Problem through Branch-and-Cut
inferredcites →https://doi.org/10.1287/trsc.1030.0079openalex-snapshot
Traveling Salesman Problems with Profits
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.