A tolerance function for the multiobjective set covering problem (Q1733317): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11590-018-1267-5 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: vOptLib / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GitHub / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-018-1267-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2802300968 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of very large-scale neighborhood search techniques / 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: A Heuristic Method for the Set Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey and annotated bibliography of multiobjective combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Multiobjective Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic algorithm for the multi-criteria set-covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable and large neighborhood search to solve the multiobjective set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearization approach to multi-objective quadratic set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi‐objective combinatorial optimization problems: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covers and approximations in multiobjective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for approximating the Pareto set of the multiobjective set covering problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11590-018-1267-5 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:36, 11 December 2024

scientific article
Language Label Description Also known as
English
A tolerance function for the multiobjective set covering problem
scientific article

    Statements

    A tolerance function for the multiobjective set covering problem (English)
    0 references
    0 references
    0 references
    21 March 2019
    0 references
    approximation algorithm
    0 references
    approximation error
    0 references
    representation
    0 references
    combinatorial optimization
    0 references
    efficient solution
    0 references
    MAX-ordering
    0 references
    0 references
    0 references

    Identifiers