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...
| Những tác giả chính: | , , , |
|---|---|
| Định dạng: | Bài viết |
| Ngôn ngữ: | English |
| Được phát hành: |
University of Belgrade
2023-01-01
|
| Loạt: | Yugoslav Journal of Operations Research |
| Những chủ đề: | |
| Truy cập trực tuyến: | https://doiserbia.nb.rs/img/doi/0354-0243/2023/0354-02432200037N.pdf |