Solving the set covering problem with conflicts on sets: a new parallel GRASP

Cites Work

Unnamed Item
The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
The minimum cost perfect matching problem with conflict pair constraints
The maximum flow problem with disjunctive constraints
Online variable-sized bin packing with conflicts
A unified approach to approximating partial covering problems
Paths, trees and matchings under disjunctive constraints
Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach
An effective and simple heuristic for the set covering problem
Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
A probabilistic heuristic for a computationally difficult set covering problem
Computational experience with approximation algorithms for the set covering problem
Carousel greedy: a generalized greedy algorithm with applications in optimization
A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints
The directed profitable rural postman problem with incompatibility constraints
An algorithm for set covering problem
Exact solution algorithms for the maximum flow problem with additional conflict constraints
Bin packing problem with conflicts and item fragmentation
A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
Set covering problem with conflict constraints
The Knapsack Problem with Conflict Graphs
A Greedy Heuristic for the Set-Covering Problem
BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints
Parameterized complexity of geometric covering problems having conflicts
Parameterized complexity of conflict-free set cover
Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand
A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs
A Convex Reformulation and an Outer Approximation for a Large Class of Binary Quadratic Programs

This page was built for publication: Solving the set covering problem with conflicts on sets: a new parallel GRASP