An algorithm for approximating the Pareto set of the multiobjective set covering problem (Q513581): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
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.1007/s10479-016-2229-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2400262174 / 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: An existence result for maximizations with respect to cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring relaxation induced neighborhoods to improve MIP solutions / 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: Local branching / 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: Error Detecting and Error Correcting Codes / 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: Variable neighborhood search and local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523706 / 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: 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: Heuristic approaches for biobjective mixed 0-1 integer linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi‐objective combinatorial optimization problems: A survey / rank
 
Normal rank

Revision as of 12:13, 13 July 2024

scientific article
Language Label Description Also known as
English
An algorithm for approximating the Pareto set of the multiobjective set covering problem
scientific article

    Statements

    An algorithm for approximating the Pareto set of the multiobjective set covering problem (English)
    0 references
    0 references
    0 references
    0 references
    7 March 2017
    0 references
    multiobjective set covering problem
    0 references
    heuristics
    0 references
    local branching
    0 references
    tree-based search
    0 references

    Identifiers