Using the WOWA operator in robust discrete optimization problems

April 29, 2015 Β· Declared Dead Β· πŸ› International Journal of Approximate Reasoning

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Adam Kasperski, Pawel Zielinski arXiv ID 1504.07863 Category cs.DS: Data Structures & Algorithms Citations 11 Venue International Journal of Approximate Reasoning Last Checked 4 months ago
Abstract
In this paper a class of discrete optimization problems with uncertain costs is discussed. The uncertainty is modeled by introducing a scenario set containing a finite number of cost scenarios. A probability distribution in the scenario set is available. In order to choose a solution the weighted OWA criterion (WOWA) is applied. This criterion allows decision makers to take into account both probabilities for scenarios and the degree of pessimism/ optimism. In this paper the complexity of the considered class of discrete optimization problems is described and some exact and approximation algorithms for solving it are proposed. An application to a selection problem, together with results of computational tests are shown.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted