The inverse k-max combinatorial optimization problem

Classical combinatorial optimization concerns finding a feasible subset of a ground set in order to optimize an objective function. We address in this article the inverse optimization problem with the k-max function. In other words, we attempt to perturb the weights of elements in the ground set at...

Full description

Saved in:
Bibliographic Details
Published in:Yugoslav Journal of Operations Research Vol. 33; no. 2; pp. 309 - 322
Main Authors: Nhan, Tran, Nguyen, Kien, Hung, Nguyen, Toan, Nguyen
Format: Journal Article
Language:English
Published: University of Belgrade 2023
Subjects:
bottleneck
combinatorial algorithms
convex
inverse optimization
k-max
ISSN:0354-0243, 1820-743X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Classical combinatorial optimization concerns finding a feasible subset of a ground set in order to optimize an objective function. We address in this article the inverse optimization problem with the k-max function. In other words, we attempt to perturb the weights of elements in the ground set at minimum total cost to make a predetermined subset optimal in the fashion of the k-max objective with respect to the perturbed weights. We first show that the problem is in general NP-hard. Regarding the case of independent feasible subsets, a combinatorial O(n2 log n) time algorithm is developed, where n is the number of elements in E. Special cases with improved complexity are also discussed.
AbstractList Classical combinatorial optimization concerns finding a feasible subset of a ground set in order to optimize an objective function. We address in this article the inverse optimization problem with the k-max function. In other words, we attempt to perturb the weights of elements in the ground set at minimum total cost to make a predetermined subset optimal in the fashion of the k-max objective with respect to the perturbed weights. We first show that the problem is in general NP-hard. Regarding the case of independent feasible subsets, a combinatorial O(n2 log n) time algorithm is developed, where n is the number of elements in E. Special cases with improved complexity are also discussed.
Author Nhan, Tran
Hung, Nguyen
Toan, Nguyen
Nguyen, Kien
Author_xml – sequence: 1
  givenname: Tran
  surname: Nhan
  fullname: Nhan, Tran
  organization: Faculty of Basic Sciences, Vinh Long University of Technology Education, Vinh Long, Vietnam
– sequence: 2
  givenname: Kien
  surname: Nguyen
  fullname: Nguyen, Kien
  organization: Department of Mathematics, Teacher College, Can Tho University, Can Tho, Vietnam
– sequence: 3
  givenname: Nguyen
  surname: Hung
  fullname: Hung, Nguyen
  organization: Department of Mathematics, Teacher College, Can Tho University, Can Tho, Vietnam
– sequence: 4
  givenname: Nguyen
  surname: Toan
  fullname: Toan, Nguyen
  organization: Faculty of Mathematics and Computer Science, University of Science, Ho Chi Minh City, Vietnam + National University, Ho Chi Minh City, Vietnam + Faculty of Basic Sciences, Vinh Long University of Technology Education, Vinh Long, Vietnam
BookMark eNpV0E1Lw0AQBuBFKlhrr57zB1L3I9vdHKX4USkWpIKeltnJVFeTbNkEUX-9qYogcxh4D88w7zEbtbElxk4Fn0lZ2rPHm_WdlFyLOVfm9oCNhZU8N4V6GLExV7rIuSzUEZt2XfBcGGWt1HbMis0zZaF9o9RR9po38J5hbHxooY8pQJ3FXR-a8Al9iG22S9HX1Jywwy3UHU1_94TdX15sFtf5an21XJyvcpRCt7nfKi-EIm4QhTeV9BV6DcMgJ22GjHusqorAcolzssrqkqPVWIAFPVcTtvxxqwgvbpdCA-nDRQjuO4jpyUHqA9bkhgtkrCxNqX2hC_DD-3tKgyIkhYM1-7Ewxa5LtP3zBHf7Ct3_CtUX6yVmkw
Cites_doi 10.1080/10556788.2020.1713778
10.1080/02331934.2011.651470
10.1051/ro:2008017
10.1016/j.cor.2005.12.003
10.1080/10556788.2021.1880578
10.11650/tjm/190602
10.1016/j.ejor.2007.04.031
10.1016/j.cam.2022.114104
10.1007/s10288-011-0194-4
10.1007/11424925_19
10.1007/BF01585693
10.1002/net.10048
10.1007/s10898-016-0412-x
10.1016/j.orl.2008.09.007
10.1142/S0217595922500336
10.1287/opre.28.5.1130
10.1007/s11518-006-0140-8
10.1023/B:JOCO.0000038914.26975.9b
10.1007/BF01193863
10.1016/j.disopt.2013.03.001
10.1016/0020-0190(89)90136-1
10.1007/s10878-010-9353-3
10.1007/s10898-022-01212-5
10.1016/j.ejor.2015.06.064
10.1287/opre.49.5.771.10607
10.1016/j.dam.2019.01.001
10.1287/opre.51.5.785.16756
10.1007/s00186-018-0632-6
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.2298/YJOR220516037N
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList
CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
EISSN 1820-743X
EndPage 322
ExternalDocumentID oai_doaj_org_article_cc1e7829795b454ab8200c855a3ece3c
10_2298_YJOR220516037N
GroupedDBID AAYXX
ABJBX
CITATION
GROUPED_DOAJ
ID FETCH-LOGICAL-c215n-bf3b113e07cc1b7d2bdcb5a5a5c0e57c1b0bcdddea802c6e838590c85c4a8a563
IEDL.DBID DOA
ISSN 0354-0243
IngestDate Fri Oct 03 12:53:35 EDT 2025
Sat Nov 29 03:15:45 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
License http://creativecommons.org/licenses/by-nc-sa/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c215n-bf3b113e07cc1b7d2bdcb5a5a5c0e57c1b0bcdddea802c6e838590c85c4a8a563
OpenAccessLink https://doaj.org/article/cc1e7829795b454ab8200c855a3ece3c
PageCount 14
ParticipantIDs doaj_primary_oai_doaj_org_article_cc1e7829795b454ab8200c855a3ece3c
crossref_primary_10_2298_YJOR220516037N
PublicationCentury 2000
PublicationDate 2023-00-00
2023-01-01
PublicationDateYYYYMMDD 2023-01-01
PublicationDate_xml – year: 2023
  text: 2023-00-00
PublicationDecade 2020
PublicationTitle Yugoslav Journal of Operations Research
PublicationYear 2023
Publisher University of Belgrade
Publisher_xml – name: University of Belgrade
References ref13
ref12
ref15
ref14
ref30
ref11
ref10
ref2
ref1
ref17
ref16
ref19
ref18
ref24
ref23
ref26
ref25
ref20
ref22
ref21
ref28
ref27
ref29
ref8
ref7
ref9
ref4
ref3
ref6
ref5
References_xml – ident: ref14
  doi: 10.1080/10556788.2020.1713778
– ident: ref25
  doi: 10.1080/02331934.2011.651470
– ident: ref8
  doi: 10.1051/ro:2008017
– ident: ref24
  doi: 10.1016/j.cor.2005.12.003
– ident: ref16
  doi: 10.1080/10556788.2021.1880578
– ident: ref23
  doi: 10.11650/tjm/190602
– ident: ref4
  doi: 10.1016/j.ejor.2007.04.031
– ident: ref15
  doi: 10.1016/j.cam.2022.114104
– ident: ref12
  doi: 10.1007/s10288-011-0194-4
– ident: ref26
  doi: 10.1007/11424925_19
– ident: ref2
  doi: 10.1007/BF01585693
– ident: ref7
  doi: 10.1002/net.10048
– ident: ref10
  doi: 10.1007/s10898-016-0412-x
– ident: ref19
– ident: ref27
  doi: 10.1016/j.orl.2008.09.007
– ident: ref18
  doi: 10.1142/S0217595922500336
– ident: ref29
  doi: 10.1287/opre.28.5.1130
– ident: ref6
  doi: 10.1007/s11518-006-0140-8
– ident: ref1
  doi: 10.1023/B:JOCO.0000038914.26975.9b
– ident: ref9
  doi: 10.1007/BF01193863
– ident: ref11
  doi: 10.1016/j.disopt.2013.03.001
– ident: ref30
  doi: 10.1016/0020-0190(89)90136-1
– ident: ref20
  doi: 10.1007/s10878-010-9353-3
– ident: ref17
  doi: 10.1007/s10898-022-01212-5
– ident: ref28
– ident: ref21
  doi: 10.1016/j.ejor.2015.06.064
– ident: ref3
  doi: 10.1287/opre.49.5.771.10607
– ident: ref13
  doi: 10.1016/j.dam.2019.01.001
– ident: ref5
  doi: 10.1287/opre.51.5.785.16756
– ident: ref22
  doi: 10.1007/s00186-018-0632-6
SSID ssib017388258
ssib048656891
ssib044765231
Score 2.2393093
Snippet Classical combinatorial optimization concerns finding a feasible subset of a ground set in order to optimize an objective function. We address in this article...
SourceID doaj
crossref
SourceType Open Website
Index Database
StartPage 309
SubjectTerms bottleneck
combinatorial algorithms
convex
inverse optimization
k-max
Title The inverse k-max combinatorial optimization problem
URI https://doaj.org/article/cc1e7829795b454ab8200c855a3ece3c
Volume 33
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1820-743X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044765231
  issn: 0354-0243
  databaseCode: M~E
  dateStart: 0
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LS8QwEA6yePAiiorrix4ET2HTPJr0qLKLiK4iCuup5FVYZLuyruLJ3-5MW7WevEihh1BKOzOZR5L5PkKOTRmEwpkWyhip9FxQB3GRGpuFTPPI0lizllzp8dhMJvlth-oLz4Q18MCN4Abep1Fj_2eunFTSOghZzBulrIg-Co_el-m8U0yBJaVaQOb4s98npc5UZ79LGkhjWjo9oSRFWL4G0ZHz3AweL2_usAEVKZj1-FfE6gD71xFotEHW29QxOW0-eZOsxGqLSNBzMq3wcEVMnujMvidgQ1DuYjENtpXMwSfM2mbLpKWP2SYPo-H9-QVtmRCoh5BcUVcKl6YiMg3icDpwF7xTFi7PotIwxpwP4KmsYdxn0QijcpSSl9ZYlYkd0qvmVdwlCUwK64VDnMAoA2e5kaXjwWpnQ1marE9Ovv62eG4ALwooFFAuxW-59MkZCuP7KQSqrgdAfUWrvuIv9e39x0v2yRqywDcrIwekt1y8xkOy6t-W05fFUW0ZcL_-GH4CDze6dw
linkProvider Directory of Open Access Journals
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=The+inverse+k-max+combinatorial+optimization+problem&rft.jtitle=Yugoslav+Journal+of+Operations+Research&rft.au=Nhan%2C+Tran&rft.au=Nguyen%2C+Kien&rft.au=Hung%2C+Nguyen&rft.au=Toan%2C+Nguyen&rft.date=2023&rft.issn=0354-0243&rft.eissn=1820-743X&rft.volume=33&rft.issue=2&rft.spage=309&rft.epage=322&rft_id=info:doi/10.2298%2FYJOR220516037N&rft.externalDBID=n%2Fa&rft.externalDocID=10_2298_YJOR220516037N
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0354-0243&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0354-0243&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0354-0243&client=summon