A Column Generation Approach for Weighted Set Packing Problems with Forbidden Pairs

Johannes Schmidt () and Armin Fügenschuh ()
Additional contact information
Johannes Schmidt: Brandenburg University of Technology Cottbus-Senftenberg
Armin Fügenschuh: Brandenburg University of Technology Cottbus-Senftenberg

Chapter Chapter 14 in Operations Research Proceedings 2023, 2025, pp 107-113 from Springer

Abstract: Abstract The weighted set packing problem (WSPP) is a variant of the well-known set packing problem, assigning a weight to every considered subset of a given finite base set. Its solution is a maximum sum-weight, element-disjoint covering of the base set. Using its formulation as a binary linear program (BLP), every column of the constraint matrix describes one of the given subsets. Thus, column generation (CG) provides a good solution method, generating iteratively only promising subsets as candidates for the covering. We consider an extension of the WSPP, where forbidden pairs are taken into consideration, i.e., there can be pairs of subsets that cannot be chosen at the same time, and adapt CG to derive a new solution algorithm to solve the resulting BLP. At each iteration, the optimal solution obtained with CG is checked for potential conflicts and either they are resolved locally without changing the objective function value or a new linear constraint forbidding the conflicting pair of columns is added. Then the CG procedure starts again. The applicability of this approach is shown for a team orienteering problem involving two unmanned aerial vehicles that must maintain safety distances between them.

Keywords: Set packing problem; Conflict resolution; Column generation (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnopch:978-3-031-58405-3_14

Ordering information: This item can be ordered from
http://www.springer.com/9783031584053

DOI: 10.1007/978-3-031-58405-3_14

Access Statistics for this chapter

More chapters in Lecture Notes in Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().