Set covering problem with conflict constraints
From MaRDI portal
Publication:2147026
DOI10.1016/J.COR.2022.105763OpenAlexW4214513113MaRDI QIDQ2147026
Publication date: 22 June 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.lib.ncsu.edu/resolver/1840.20/36901
Related Items (2)
Fair allocation of indivisible items with conflict graphs ⋮ Solving the set covering problem with conflicts on sets: a new parallel GRASP
Uses Software
Cites Work
- Unnamed Item
- The minimum cost perfect matching problem with conflict pair constraints
- The maximum flow problem with disjunctive constraints
- A set-covering based heuristic algorithm for the periodic vehicle routing problem
- The minimum spanning tree problem with conflict constraints and its variations
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem
- On the mixed set covering, packing and partitioning polytope
- An algorithm for set covering problem
- Conflict graphs in solving integer programming problems
- A branch and cut algorithm for minimum spanning trees under conflict constraints
- A multiperiod set covering location model for dynamic redeployment of ambulances
- Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem
- A set-covering model for optimizing selection of portfolio of microcontrollers in an automotive supplier company
- Algorithms for the Bin Packing Problem with Conflicts
- The Knapsack Problem with Conflict Graphs
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- Disjunctive Programming
- A tutorial on branch and cut algorithms for the maximum stable set problem
- Algorithms for the set covering problem
This page was built for publication: Set covering problem with conflict constraints
