Balancing profits and costs on trees (Q5326788): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.21469 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2170236677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2845529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and Solving the Capacitated Vehicle Routing Problem on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of circular decomposable metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Profit-based latency problems on the line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sometimes Travelling is Easy: The Master Tour Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Multiobjective Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3895490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest path problem with two objective functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-objective meta-heuristics for the traveling salesman problem with profits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-objective vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edgeconvex Circuits and the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle scheduling on a tree with release and handling times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem in Kalmanson matrices and in circulant matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Vehicle Routing on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing and Scheduling on a Shoreline with Release Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria product design optimization: An efficient solution procedure using AND/OR trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting and enumeration complexity with application to multicriteria scheduling / rank
 
Normal rank

Latest revision as of 17:10, 6 July 2024

scientific article; zbMATH DE number 6195683
Language Label Description Also known as
English
Balancing profits and costs on trees
scientific article; zbMATH DE number 6195683

    Statements

    Balancing profits and costs on trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 August 2013
    0 references
    multiobjective combinatorial optimization
    0 references
    trees
    0 references
    traveling salesman problem with profits
    0 references
    Kalmanson conditions
    0 references
    complexity
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references