A new compact formulation for the discrete \(p\)-dispersion problem (Q1752169): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2016.06.036 / rank
Normal rank
 
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.1016/j.ejor.2016.06.036 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2420904346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian solution of maximum dispersion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location on Tree Networks: <i>P</i>-Centre and <i>n</i>-Dispersion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857376 / rank
 
Normal rank
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: A New Formulation and Resolution Method for the p-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete p-dispersion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical models for locating undesirable facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer-friendly formulations for the \(r\)-separation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy and hard bottleneck location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds and exact algorithms for \(p\)-dispersion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and effective algorithm for the MaxMin diversity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2016.06.036 / rank
 
Normal rank

Latest revision as of 08:16, 11 December 2024

scientific article
Language Label Description Also known as
English
A new compact formulation for the discrete \(p\)-dispersion problem
scientific article

    Statements

    A new compact formulation for the discrete \(p\)-dispersion problem (English)
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    facility location
    0 references
    dispersion problems
    0 references
    max-min objective
    0 references
    integer programming
    0 references

    Identifiers