Set covering problem with conflict constraints

DOI10.1016/J.COR.2022.105763MaRDI QIDQ2147026zbMATH OpenOpenAlexFDO

Authors Saeed Saffari, Yahya Fathi

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

zbMATH Keywords

integer programmingpre-processingset coveringvalid inequalitiesstable set

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Assignment problem with conflicts
• Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph
• Parameterized complexity of conflict-free set cover
• Maximally disjoint solutions of the set covering problem
• Algorithms for the bin packing problem with conflicts

Cites work

• scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• A branch and cut algorithm for minimum spanning trees under conflict constraints
• A multiperiod set covering location model for dynamic redeployment of ambulances
• A set-covering based heuristic algorithm for the periodic vehicle routing problem
• A set-covering model for optimizing selection of portfolio of microcontrollers in an automotive supplier company
• A tutorial on branch and cut algorithms for the maximum stable set problem
• Algorithms for the bin packing problem with conflicts
• Algorithms for the set covering problem
• An algorithm for set covering problem
• Conflict graphs in solving integer programming problems
• Disjunctive Programming
• Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem
• On the mixed set covering, packing and partitioning polytope
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem
• The Knapsack Problem with Conflict Graphs
• The maximum flow problem with disjunctive constraints
• The minimum cost perfect matching problem with conflict pair constraints
• The minimum spanning tree problem with conflict constraints and its variations
• The worst-case time complexity for generating all maximal cliques and computational experiments

Cited in

(2)

• Solving the set covering problem with conflicts on sets: a new parallel GRASP
• Fair allocation of indivisible items with conflict graphs

Describes a project that uses

Uses Software

• OR-Library

This page was built for publication: Set covering problem with conflict constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147026)