A mixed integer linear program and tabu search approach for the complementary edge covering problem (Q964367): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.advengsoft.2009.12.017 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SITATION / 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.1016/j.advengsoft.2009.12.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2063486741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An indirect genetic algorithm for set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with general cutting planes for the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A GRASP algorithm to solve the unicost set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4735035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A defensive maximal covering problem on a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility location with dynamic distance functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu-search based heuristic for the hub covering problem over incomplete hub networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian-based heuristic for large-scale set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximal covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location coverage models with demand originating from nodes and paths: Application to cellular network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving an ambulance location model by tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental analysis of approximation algorithms for the vertex cover and set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated vertex covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A neural network for the minimum set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note: A local-search heuristic for large set-covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neural networks and graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A maximal covering location model in the presence of partial coverage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Edge-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy minimum weight edge covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A column generation approach for the maximal covering location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel genetic algorithm to solve the set-covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Location of Emergency Service Facilities / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ADVENGSOFT.2009.12.017 / rank
 
Normal rank

Latest revision as of 10:16, 10 December 2024

scientific article
Language Label Description Also known as
English
A mixed integer linear program and tabu search approach for the complementary edge covering problem
scientific article

    Statements

    A mixed integer linear program and tabu search approach for the complementary edge covering problem (English)
    0 references
    0 references
    0 references
    15 April 2010
    0 references
    facility location
    0 references
    complementary edge covering problem
    0 references
    mixed integer linear model
    0 references
    heuristic algorithm
    0 references
    tabu search
    0 references
    numerical examples
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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