Inverse version of the kth maximization combinatorial optimization problem
Given a ground set of n elements with associated positive weights and a class of its subsets, also known as feasible solutions. In the setting of the original combinatorial optimization problem, each feasible solution corresponds to an objective value, often measured under the sum or the max of all...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
CAN THO UNIVERSITY PUBLISHING HOUSE
2018-07-01
|
| Series: | Can Tho University Journal of Science |
| Subjects: | |
| Online Access: | https://ctujs.ctu.edu.vn/index.php/ctujs/article/view/93 |