Set covering problem with conflict constraints (Q2147026): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2022.105763 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4214513113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict graphs in solving integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A set-covering based heuristic algorithm for the periodic vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the mixed set covering, packing and partitioning polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Bin Packing Problem with Conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A set-covering model for optimizing selection of portfolio of microcontrollers in an automotive supplier company / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum cost perfect matching problem with conflict pair constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knapsack Problem with Conflict Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum flow problem with disjunctive constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multiperiod set covering location model for dynamic redeployment of ambulances / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tutorial on branch and cut algorithms for the maximum stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut algorithm for minimum spanning trees under conflict constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The worst-case time complexity for generating all maximal cliques and computational experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum spanning tree problem with conflict constraints and its variations / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2022.105763 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:52, 17 December 2024

scientific article
Language Label Description Also known as
English
Set covering problem with conflict constraints
scientific article

    Statements

    Set covering problem with conflict constraints (English)
    0 references
    0 references
    0 references
    22 June 2022
    0 references
    set covering
    0 references
    stable set
    0 references
    integer programming
    0 references
    valid inequalities
    0 references
    pre-processing
    0 references
    0 references

    Identifiers