Maximizing single attribute diversity in group selection (Q2678607): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-022-04764-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4281567663 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding k points with minimum diameter and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the maximum min-sum dispersion by alternating formulations of two different problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction and improvement algorithms for dispersion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounds for selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-sum diversity via convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance analysis of non-banking finance companies using two-stage data envelopment analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum diversity problem with squared Euclidean distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Electing a committee with dominance constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the unified dispersion problem: efficient formulations and exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the maximum diversity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic and Special Case Algorithms for Dispersion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Managing portfolio diversity within the mean variance theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study on two geometric location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distant diversity in dynamic class prediction / rank
 
Normal rank

Latest revision as of 08:40, 31 July 2024

scientific article
Language Label Description Also known as
English
Maximizing single attribute diversity in group selection
scientific article

    Statements

    Maximizing single attribute diversity in group selection (English)
    0 references
    0 references
    0 references
    0 references
    23 January 2023
    0 references
    combinatorial optimization
    0 references
    group selection
    0 references
    maximum diversity
    0 references
    Euclidean distance
    0 references
    polynomial algorithm
    0 references

    Identifiers