Robust Approach to Restricted Items Selection Problem

We consider the robust version of items selection problem, in which the goal is to choose representatives from a family of sets, preserving constraints on the allowed items' combinations. We prove NP-hardness of the deterministic version, and establish polynomially solvable special cases. Next,...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Author Drwal, Maciej
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 22.07.2019
Subjects
Online AccessGet full text

Cover

Loading…
Abstract We consider the robust version of items selection problem, in which the goal is to choose representatives from a family of sets, preserving constraints on the allowed items' combinations. We prove NP-hardness of the deterministic version, and establish polynomially solvable special cases. Next, we consider the robust version in which we aim at minimizing the maximum regret of the solution under interval parameter uncertainty. We show that this problem is hard for the second level of polynomial-time hierarchy. We develop an exact solution algorithm for the robust problem, based on cut generation, and present the results of computational experiments.
AbstractList We consider the robust version of items selection problem, in which the goal is to choose representatives from a family of sets, preserving constraints on the allowed items' combinations. We prove NP-hardness of the deterministic version, and establish polynomially solvable special cases. Next, we consider the robust version in which we aim at minimizing the maximum regret of the solution under interval parameter uncertainty. We show that this problem is hard for the second level of polynomial-time hierarchy. We develop an exact solution algorithm for the robust problem, based on cut generation, and present the results of computational experiments.
Author Drwal, Maciej
Author_xml – sequence: 1
  givenname: Maciej
  surname: Drwal
  fullname: Drwal, Maciej
BookMark eNqNjL0OgjAURhujiai8QxNnknpLwdUYjW4G3QnUa4SUXuzP-8vgAzh9wznnW7G5JYszloCUu2yfAyxZ6n0vhICiBKVkwlRFbfSBH8bRUaPfPBCv0AfX6YBPfg04eH5Hgzp0ZPnNUWtw2LDFqzEe09-u2fZ8ehwv2XTyiVNe9xSdnVANUIDKhSyV_M_6AsLzNqI
ContentType Paper
Copyright 2019. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2019. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID 8FE
8FG
ABJCF
ABUWG
AFKRA
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
HCIFZ
L6V
M7S
PIMPY
PQEST
PQQKQ
PQUKI
PRINS
PTHSS
DatabaseName ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Database (Proquest)
ProQuest Central (Alumni)
ProQuest Central
ProQuest Central Essentials
ProQuest Central
Technology Collection
ProQuest One Community College
ProQuest Central
SciTech Premium Collection (Proquest) (PQ_SDU_P3)
ProQuest Engineering Collection
Engineering Database
Publicly Available Content Database
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Academic
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
DatabaseTitle Publicly Available Content Database
Engineering Database
Technology Collection
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central China
ProQuest Central
ProQuest Engineering Collection
ProQuest One Academic UKI Edition
ProQuest Central Korea
Materials Science & Engineering Collection
ProQuest One Academic
Engineering Collection
DatabaseTitleList Publicly Available Content Database
Database_xml – sequence: 1
  dbid: 8FG
  name: ProQuest Technology Collection
  url: https://search.proquest.com/technologycollection1
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Physics
EISSN 2331-8422
Genre Working Paper/Pre-Print
GroupedDBID 8FE
8FG
ABJCF
ABUWG
AFKRA
ALMA_UNASSIGNED_HOLDINGS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
FRJ
HCIFZ
L6V
M7S
M~E
PIMPY
PQEST
PQQKQ
PQUKI
PRINS
PTHSS
ID FETCH-proquest_journals_22625403753
IEDL.DBID 8FG
IngestDate Mon Oct 07 13:11:29 EDT 2024
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-proquest_journals_22625403753
OpenAccessLink https://www.proquest.com/docview/2262540375/abstract/?pq-origsite=%requestingapplication%
PQID 2262540375
PQPubID 2050157
ParticipantIDs proquest_journals_2262540375
PublicationCentury 2000
PublicationDate 20190722
PublicationDateYYYYMMDD 2019-07-22
PublicationDate_xml – month: 07
  year: 2019
  text: 20190722
  day: 22
PublicationDecade 2010
PublicationPlace Ithaca
PublicationPlace_xml – name: Ithaca
PublicationTitle arXiv.org
PublicationYear 2019
Publisher Cornell University Library, arXiv.org
Publisher_xml – name: Cornell University Library, arXiv.org
SSID ssj0002672553
Score 3.2227461
SecondaryResourceType preprint
Snippet We consider the robust version of items selection problem, in which the goal is to choose representatives from a family of sets, preserving constraints on the...
SourceID proquest
SourceType Aggregation Database
SubjectTerms Algorithms
Parameter uncertainty
Polynomials
Robustness (mathematics)
Title Robust Approach to Restricted Items Selection Problem
URI https://www.proquest.com/docview/2262540375/abstract/
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1LS8NAEB5qg-CtvvBRy4JelzTZZEtOUiUxCC0hKvRW9nk0tUmv_e3uxEQPQo_Lwi47LPPNzO43H8AD41wFRkpqNHcJig0sFVIIKiOjLTPJVCfIHV4sef4Rva7i1QDynguD3yp7n9g6al0prJH7LkxwuQwqtvpCYhVANf7j5ouifhS-s3ZiGkfgBdgTDznj2ctvtSXkMxc7s38Ot0WRbAReITZmewoD83kGx-3nS1WfQ1xWclc3ZN719yZNRUqDghrKxYMEq-k1eWsFa5wVSfGjAXMB91n6_pzTfq91dy_q9d8p2CUMXYJvroAEMg6U1ZZrJR08RAmLmBWoTK6FmqrZNYwPrXRzePoWThzII1OJhuEYhs12Z-4ckDZy0tpoAt5TuixKN1rs028mqn9X
link.rule.ids 786,790,12792,21416,33408,33779,43635,43840
linkProvider ProQuest
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1LSwMxEB60RfTmEx9VA3oNdjfZlD2JiOuqbSm1Qm9Lnke3Ntv_72RN9SD0HEiGIcw382UmH8AtE0InVilqjcACxSWOSiUlVdwax2zeN3mYHR6NRfnBX-fZPBJuPrZVrmNiG6hNrQNHfodpAtYyQbH1fvFFg2pUeF2NEhrb0OUMoTNMihfPvxxLKgaYMbN_YbbFjmIfuhO5sMsD2LKfh7DTtlxqfwTZtFYr35CH-Ks3aWoytUFGQ2MWSAKH7sl7K1ODviOTH-WXY7gpnmaPJV2fVcXb4Ks_29kJdLCst6dAEpUl2hknjFYICjxnnDkZ9MiN1H09OIPepp3ONy9fw245Gw2r4cv47QL2EObDrBJN0x50muXKXiKUNuqq9dc3Hhx7ug
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Robust+Approach+to+Restricted+Items+Selection+Problem&rft.jtitle=arXiv.org&rft.au=Drwal%2C+Maciej&rft.date=2019-07-22&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422