The equitable dispersion problem
type: Item
instance of: scholarly article
title: The equitable dispersion problem
zbMATH Open document ID: 1157.90539
author: Oleg A. Prokopyev
author: Nan Kong
author: Dayna L. Martinez-Torres
published in: European Journal of Operational Research
publication date: 2009-04-08T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5541432
zbMATH Keywords: equitable dispersion
zbMATH Keywords: maximum dispersion
zbMATH Keywords: equity
zbMATH Keywords: binary nonlinear programming
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: j.ejor.2008.06.005
OpenAlex ID: W2154629615
cites work: Maximum diversity/similarity models with extension to part grouping
cites work: Q3056948
cites work: Lagrangian solution of maximum dispersion problems
cites work: Q4398864
cites work: Q3145799
cites work: The Knapsack Sharing Problem
cites work: The Sharing Problem
cites work: Exact Solution of the Quadratic Knapsack Problem
cites work: The complexity of regular subgraph recognition
cites work: Q4947393
cites work: Analytical models for locating undesirable facilities
cites work: The discrete p-dispersion problem
cites work: Greedy randomized adaptive search procedures
cites work: Q4198056
cites work: Computational aspects of the maximum diversity problem
cites work: Heuristic algorithms for the maximum diversity problem
cites work: Q4867320
cites work: Approximation algorithms for maximum dispersion
cites work: Lower bound improvement and forcing rule for quadratic binary programming
cites work: Good solutions to discrete noxious location problems via metaheuristics
cites work: An Analysis of Network Location Problems with Distance Constraints
cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming
cites work: Q3993417
cites work: A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
cites work: Upper bounds and exact algorithms for \(p\)-dispersion problems
cites work: A Multiobjective Model For Locating Solid Waste Transfer Facilities Using An Empirical Opposition Function
cites work: Heuristic and Special Case Algorithms for Dispersion Problems
cites work: GRASP and path relinking for the max-min diversity problem
cites work: Global optimization of 0-1 hyperbolic programs
cites work: An empirical comparison of heuristic methods for creating maximally diverse groups
cites work: A note on a global approach for general 0-1 fractional programming
cites work: Q4862624
DOI: 10.1016/J.EJOR.2008.06.005
Recommended article: On the existence of an equitable allocation
Recommended article: Towards equitable distribution via proportional equity constraints
Recommended article: Q4268138
Recommended article: Equitable allocation of divisible goods
Recommended article: Inequality measures and equitable approaches to location problems
Recommended article: Implementing Efficient Egalitarian Equivalent Allocations
Recommended article: Q5482306
Recommended article: Q3735451
Recommended article: Fair Allocation with Diminishing Differences
Recommended article: Fair allocation of indivisible goods with minimum inequality or minimum envy
description: scientific article; zbMATH DE number 5541432