Complexity evaluation of benchmark instances for the \(p\)-median problem (Q636452): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(8 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.mcm.2010.12.047 / rank
Normal rank
 
Property / author
 
Property / author: Q636450 / rank
Normal rank
 
Property / author
 
Property / author: Dmitry Krushinsky / rank
Normal rank
 
Property / author
 
Property / author: Boris I. Goldengorin / rank
 
Normal rank
Property / author
 
Property / author: Dmitry Krushinsky / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / 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.mcm.2010.12.047 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973994147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution methods for thep-median problem: An annotated bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(p\)-median problem: a survey of metaheuristic approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bibliography for some fundamental problem categories in discrete location science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5316730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational study of large-scale \(p\)-median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Optimal Diversity Management Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presolving in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Zero-One Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the simple plant location problem using a data correcting approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4735935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supernode processing of mixed-integer models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical reduction tests for the p-problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5650510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Canonical Representation of Simple Plant Location Problems and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tighter formulation of the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: COBRA: A new formulation of the classic \(p\)-median location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on solving large p-median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(p\)-median polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data aggregation for \(p\)-median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Leaf Out-Branching Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.MCM.2010.12.047 / rank
 
Normal rank

Latest revision as of 23:16, 9 December 2024

scientific article
Language Label Description Also known as
English
Complexity evaluation of benchmark instances for the \(p\)-median problem
scientific article

    Statements

    Complexity evaluation of benchmark instances for the \(p\)-median problem (English)
    0 references
    28 August 2011
    0 references
    \(p\)-median problem
    0 references
    pseudo-Boolean polynomial
    0 references
    problem size reduction
    0 references
    data complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers