Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits (Q336534): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2013.02.011 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation results for a bicriteria job scheduling problem on a single machine without preemption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the bi-criteria weighted MAX-CUT problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. / 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: A heuristic algorithm for master planning that satisfies multiple objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balancing profits and costs on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating \(\varepsilon\)-efficient solutions in multiobjective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Multiobjective Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding representative systems for discrete bicriterion optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence theorems in vector optimization / 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: A genetic algorithm for a bi-objective capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The biobjective travelling purchaser problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary conditions for ε-optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\epsilon\)-solutions in vector minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling and heuristics of FMS scheduling with multiple objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metaheuristics: A bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two phase algorithms for the bi-objective assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the set of alternatives in discrete multicriterion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiently computing succinct trade-off curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Epsilon efficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Epsilon approximate solutions for multiobjective programming problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2013.02.011 / rank
 
Normal rank

Latest revision as of 14:47, 9 December 2024

scientific article
Language Label Description Also known as
English
Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
scientific article

    Statements

    Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits (English)
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    multi-objective combinatorial optimization
    0 references
    complexity
    0 references
    approximation
    0 references
    TSP with profits
    0 references
    0 references
    0 references
    0 references

    Identifiers