On the public citation graph
Balancing profits and costs on trees
0 signed · 55 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/nav.10031openalex-snapshot
Bicriteria product design optimization: An efficient solution procedure using AND/OR trees
inferredcites →https://doi.org/10.1007/11602613_105openalex-snapshot
The Capacitated Traveling Salesman Problem with Pickups and Deliveries on a Tree
inferredcites →https://doi.org/10.1007/3-540-61680-2_77openalex-snapshot
The structure of circular decomposable metrics
inferredcites →https://doi.org/10.1007/978-0-230-37405-8_1openalex-snapshot
Introduction to algorithms
inferredcites →https://doi.org/10.1007/978-0-387-77778-8_11openalex-snapshot
Modeling and Solving the Capacitated Vehicle Routing Problem on Trees
inferredcites →https://doi.org/10.1007/978-1-4899-7687-1_100317openalex-snapshot
Multi-criteria Optimization
inferredcites →https://doi.org/10.1007/978-3-642-48782-8openalex-snapshot
Multiple Criteria Decision Making Theory and Application
inferredcites →https://doi.org/10.1007/978-3-642-48782-8_9openalex-snapshot
Bicriterion Path Problems
inferredcites →https://doi.org/10.1007/b106275openalex-snapshot
Multicriteria Scheduling : Theory, Models and Algorithms
inferredcites →https://doi.org/10.1007/s10288-005-0063-0openalex-snapshot
Counting and enumeration complexity with application to multicriteria scheduling
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/0166-218x(95)00054-uopenalex-snapshot
A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
inferredcites →https://doi.org/10.1016/0377-2217(86)90092-5openalex-snapshot
The shortest path problem with two objective functions
inferredcites →https://doi.org/10.1016/j.dam.2006.03.034openalex-snapshot
Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models
inferredcites →https://doi.org/10.1016/j.ejor.2007.05.055openalex-snapshot
Multi-objective vehicle routing problems
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.entcs.2003.12.015openalex-snapshot
How to Collect Balls Moving in the Euclidean Plane
inferredcites →https://doi.org/10.1016/j.orl.2007.11.001openalex-snapshot
Profit-based latency problems on the line
inferredcites →https://doi.org/10.1016/s0969-6016(99)00024-6openalex-snapshot
Approximation algorithms for combinatorial multicriteria optimization problems
inferredcites →https://doi.org/10.1023/a:1009881510868openalex-snapshot
The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices
inferredcites →https://doi.org/10.1023/a:1018928911513openalex-snapshot
Vehicle scheduling on a tree with release and handling times
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/sccc.1997.637087openalex-snapshot
The very offline k-vehicle routing problem in trees
inferredcites →https://doi.org/10.1109/sfcs.2000.892068openalex-snapshot
On the approximability of trade-offs and optimal access of Web sources
inferredcites →https://doi.org/10.1137/s0895480195281878openalex-snapshot
Sometimes Travelling is Easy: The Master Tour Problem
inferredcites →https://doi.org/10.1145/321978.321982openalex-snapshot
Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
inferredcites →https://doi.org/10.1201/9781420010749-38openalex-snapshot
Sensitivity Analysis in Combinatorial Optimization
inferredcites →https://doi.org/10.1287/ijoc.12.1.57.11901openalex-snapshot
When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
inferredcites →https://doi.org/10.1287/mnsc.36.2.212openalex-snapshot
Routing and Scheduling on a Shoreline with Release Times
inferredcites →https://doi.org/10.1287/mnsc.48.12.1603.445openalex-snapshot
Approximating Multiobjective Knapsack Problems
inferredcites →https://doi.org/10.1287/moor.8.1.1openalex-snapshot
On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
inferredcites →https://doi.org/10.1287/opre.39.4.616openalex-snapshot
Capacitated Vehicle Routing on Trees
inferredcites →https://doi.org/10.1287/trsc.1030.0079openalex-snapshot
Traveling Salesman Problems with Profits
inferredcites →https://doi.org/10.1556/sscmath.46.2009.2.1090openalex-snapshot
The distance of \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra}…
inferredcites →https://doi.org/10.4153/cjm-1975-104-6openalex-snapshot
Edgeconvex Circuits and the Traveling Salesman Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-22204-2_6openalex-snapshot
The Complexity of Cyber Attacks in a New Layered-Security Model and the Maximum-Weight, Rooted-Subtree Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-26626-8_52openalex-snapshot
A New Tractable Case of the QAP with a Robinson Matrix
inferred← citeshttps://doi.org/10.1007/s00236-026-00541-2openalex-snapshot
Multi-points cyber defense ($$1+\epsilon $$) and $$(1+\epsilon )^{k-k'}$$-approximation
inferred← citeshttps://doi.org/10.1007/s13676-012-0016-7openalex-snapshot
Inventory routing problems: an introduction
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1016/j.cor.2022.105798openalex-snapshot
Exact algorithms for budgeted prize-collecting covering subgraph problems
inferred← citeshttps://doi.org/10.1016/j.disopt.2014.09.003openalex-snapshot
Four-point conditions for the TSP: The complete complexity classification
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.07.060openalex-snapshot
Polynomially solvable cases of the bipartite traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.12.024openalex-snapshot
New special cases of the Quadratic Assignment Problem with diagonally structured coefficient matrices
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.07.001openalex-snapshot
Attack and defense in the layered cyber-security model and their (1 ± ϵ)-approximation schemes
inferred← citeshttps://doi.org/10.1109/icsec.2017.8443870openalex-snapshot
The Complexity of the Infinity Replacement Problem in the Cyber Security Model
inferred← citeshttps://doi.org/10.1287/moor.2022.0306openalex-snapshot
A Polynomial-Time Algorithm for the Probabilistic Profitable Tour Problem on a Tree
inferred← citeshttps://doi.org/10.1287/opre.1110.0919openalex-snapshot
Charlemagne's Challenge: The Periodic Latency Problem
inferred← citeshttps://doi.org/10.14232/actacyb.22.3.2016.3openalex-snapshot
On Cyber Attacks and the Maximum-Weight Rooted-Subtree Problem
inferred← citeshttps://doi.org/10.14232/actacyb.22.4.2016.2openalex-snapshot
The Structure of Rooted Weighted Trees Modeling Layered Cyber-security Systems
inferred← citeshttps://doi.org/10.2139/ssrn.7403131openalex-snapshot
A Decomposition Framework for Bi-Objective Travelling Salesman Problems with Profits
inferred← citeshttps://doi.org/10.48550/arxiv.1605.03569openalex-snapshot
The structure and topology of rooted weighted trees modeling layered cyber-security systems
inferred← citeshttps://doi.org/10.59254/sbpo-2020-122731openalex-snapshot
UMA ABORDAGEM BIOBJETIVO PARA DEFINIR ROTAS DE ESCOAMENTO DE MINÉRIO DE FERRO
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.