Complexity of local search for the \(p\)-median problem (Q932191): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2006.12.063 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067606835 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2006.12.063 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067606835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Search Heuristics for <i>k</i>-Median and Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / 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: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Local Search in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Local Search Problems that are Hard to Solve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On local search for the generalized graph coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365127 / rank
 
Normal rank

Latest revision as of 13:15, 28 June 2024

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

    Statements

    Complexity of local search for the \(p\)-median problem (English)
    0 references
    0 references
    0 references
    0 references
    10 July 2008
    0 references
    0 references
    local search
    0 references
    PLS-completeness
    0 references
    pivoting rules
    0 references
    Karush-Kuhn-Tucker conditions
    0 references
    0-1 local saddle points
    0 references
    pseudo-Boolean functions
    0 references
    0 references