A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem (Q3195327): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A heuristic approach for the max-min diversity problem based on max-clique / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Local branching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational aspects of the maximum diversity problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: GRASP and path relinking for the equitable dispersion problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The quadratic knapsack problem -- a survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The equitable dispersion problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: GRASP and path relinking for the max-min diversity problem / rank | |||
Normal rank | |||
Latest revision as of 21:44, 10 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem |
scientific article |
Statements
A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem (English)
0 references
16 October 2015
0 references
max-mean dispersion problem
0 references
quadratic programming
0 references
matheuristics
0 references
