From complexity to creativity: explorations in evolutionary, autopoietic, and cognitive dynamics
From complexity to creativity: explorations in evolutionary, autopoietic, and cognitive dynamics
Advances in computational and stochastic optimization, logic programming, and heuristic search
Dynamic Programming
A Minimal Algorithm for the Bounded Knapsack Problem
INFORMS Journal on Computing
A practical approach for efficiently answering top-k relational queries
Decision Support Systems
A tabu search approach for the livestock collection problem
Computers and Operations Research
Finding diverse and similar solutions in constraint programming
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Review: Industrial aspects and literature survey: Fleet composition and routing
Computers and Operations Research
How to select a small set of diverse solutions to mixed integer programming problems
Operations Research Letters
| Hi-index | 0.00 |
Decision-makers often want to see a diverse collection of good solutions in addition to a solution that is in some mathematical sense an optimal solution to a problem. The purpose of the objective function is to quantify the notion "good", while the purpose of this paper is to exhibit a suitable function for quantifying the notion "diverse". We focus on the case where important aspects of the solutions are best represented as matrices or sets of vectors, such as when the solution involves selections. We establish a distance function and its connections with related distance functions used in optimization and psychology. A real-world application illustrates its use for decision support.