Robust multicovers with budgeted uncertainty

Sven O. Krumke, Eva Schmidt and Manuel Streicher

European Journal of Operational Research, 2019, vol. 274, issue 3, 845-857

Abstract: The Min-q-Multiset Multicover problem presented in this paper is a special version of the Multiset Multicover problem. For a fixed positive integer q, we are given a finite ground set J, an integral demand for each element in J and a collection of subsets of J. The task is to choose sets of the collection (multiple choices are allowed) such that each element in J is covered at least as many times as specified by the demand of the element. In contrast to Multiset Multicover, in Min-q-Multiset Multicover each of the chosen subsets may only cover up to q of its elements with multiple choices being allowed.

Keywords: Uncertainty modeling; Robust optimization; Discrete optimization; Covering problem (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221718309901
Full text for ScienceDirect subscribers only

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:eee:ejores:v:274:y:2019:i:3:p:845-857

DOI: 10.1016/j.ejor.2018.11.049

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().