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

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!