Dynamically second-preferred \(p\)-center problem (Q6106963): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Lagrangean duals and exact solution to the capacitated \(p\)-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: When centers can fail: a close second opportunity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The reliable \(p\)-median problem with at-facility service / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rank pricing problem: models and branch-and-cut algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strengthened formulation for the simple plant location problem with order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences / 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: The rank pricing problem with ties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed-integer formulations for the capacitated rank pricing problem with envy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Solution Methods for Two Location Problems with Unreliable Facilities / 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: A comparison of formulations and solution methods for the minimum-envy location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large <i>p</i>-Median Problems with a Radius Formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliability Models for the Uncapacitated Facility Location Problem with User Preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Capacitated <i>K</i>-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Models and Search Algorithms for the Capacitated <i>p</i>-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New facets for the two-stage uncapacitated facility location polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP and VNS for solving the \(p\)-next center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metaheuristic methods for solving the Bilevel Uncapacitated Facility Location Problem with Clients' Preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metaheuristic approaches to solving large-scale Bilevel Uncapacitated Facility Location Problem with clients' preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A flexible model and efficient solution strategies for discrete location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extended covering model for flexible discrete and equity location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the<i>p</i>-Center problem with Tabu Search and Variable Neighborhood Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the capacitated vertex \(p\)-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-scale local search heuristics for the capacitated vertex<i>p</i>-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bounds for the facility location problem with clients’ preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral study of simple plant location problem with order / rank
 
Normal rank

Revision as of 14:35, 1 August 2024

scientific article; zbMATH DE number 7705800
Language Label Description Also known as
English
Dynamically second-preferred \(p\)-center problem
scientific article; zbMATH DE number 7705800

    Statements

    Dynamically second-preferred \(p\)-center problem (English)
    0 references
    0 references
    0 references
    0 references
    3 July 2023
    0 references
    location
    0 references
    \(p\)-center
    0 references
    integer programming
    0 references
    \(p\)-next center
    0 references
    0 references

    Identifiers