Balancing profits and costs on trees
From MaRDI portal
Publication:5326788
DOI10.1002/net.21469zbMath1269.90091OpenAlexW2170236677MaRDI QIDQ5326788
Elisa Stevanato, Carlo Filippi, Sofie Coene, Frits C. R. Spieksma
Publication date: 6 August 2013
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21469
complexitytreesmultiobjective combinatorial optimizationtraveling salesman problem with profitsKalmanson conditions
Programming involving graphs or networks (90C35) Trees (05C05) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)
Related Items (7)
Exact algorithms for budgeted prize-collecting covering subgraph problems ⋮ Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits ⋮ Attack and defense in the layered cyber-security model and their \((1 \pm \varepsilon)\)-approximation schemes ⋮ Polynomially solvable cases of the bipartite traveling salesman problem ⋮ New special cases of the quadratic assignment problem with diagonally structured coefficient matrices ⋮ A New Tractable Case of the QAP with a Robinson Matrix ⋮ Four-point conditions for the TSP: the complete complexity classification
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient spanning trees
- Multi-objective meta-heuristics for the traveling salesman problem with profits
- Profit-based latency problems on the line
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- The shortest path problem with two objective functions
- The Steiner tree problem in Kalmanson matrices and in circulant matrices
- Vehicle scheduling on a tree with release and handling times
- Multicriteria optimization
- A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
- Multi-objective vehicle routing problems
- Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models
- Approximating Multiobjective Knapsack Problems
- Routing and Scheduling on a Shoreline with Release Times
- Modeling and Solving the Capacitated Vehicle Routing Problem on Trees
- Capacitated Vehicle Routing on Trees
- Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
- Sometimes Travelling is Easy: The Master Tour Problem
- The structure of circular decomposable metrics
- On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
- Edgeconvex Circuits and the Traveling Salesman Problem
- Bicriteria product design optimization: An efficient solution procedure using AND/OR trees
- Counting and enumeration complexity with application to multicriteria scheduling
This page was built for publication: Balancing profits and costs on trees
