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

From MaRDI portal

Jump to:navigation, search

← Older edit Newer edit →

Revision as of 10:44, 5 September 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

scholarly article

0 references

Dynamically second-preferred \(p\)-center problem (English)

0 references

Yolanda Hinojosa

0 references

0 references

0 references

European Journal of Operational Research

0 references

publication date

3 July 2023

0 references

zbMATH Keywords

location

0 references

\(p\)-center

0 references

integer programming

0 references

\(p\)-next center

0 references

MaRDI profile type

MaRDI publication profile

0 references

Lagrangean duals and exact solution to the capacitated \(p\)-center problem

0 references

When centers can fail: a close second opportunity

0 references

The reliable \(p\)-median problem with at-facility service

0 references

The rank pricing problem: models and branch-and-cut algorithms

0 references

A strengthened formulation for the simple plant location problem with order

0 references

Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences

0 references

A Canonical Representation of Simple Plant Location Problems and Its Applications

0 references

The rank pricing problem with ties

0 references

Mixed-integer formulations for the capacitated rank pricing problem with envy

0 references

Heuristic Solution Methods for Two Location Problems with Unreliable Facilities

0 references

A New Formulation and Resolution Method for the p-Center Problem

0 references

A comparison of formulations and solution methods for the minimum-envy location problem

0 references

Solving Large <i>p</i>-Median Problems with a Radius Formulation

0 references

Reliability Models for the Uncapacitated Facility Location Problem with User Preferences

0 references

Technical Note—A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees

0 references

An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers

0 references

The Capacitated <i>K</i>-Center Problem

0 references

Mathematical Models and Search Algorithms for the Capacitated <i>p</i>-Center Problem

0 references

New facets for the two-stage uncapacitated facility location polytope

0 references

Location Science

0 references

GRASP and VNS for solving the \(p\)-next center problem

0 references

Metaheuristic methods for solving the Bilevel Uncapacitated Facility Location Problem with Clients' Preferences

0 references

Metaheuristic approaches to solving large-scale Bilevel Uncapacitated Facility Location Problem with clients' preferences

0 references

A flexible model and efficient solution strategies for discrete location problems

0 references

An extended covering model for flexible discrete and equity location problems

0 references

Solving the<i>p</i>-Center problem with Tabu Search and Variable Neighborhood Search

0 references

An exact algorithm for the capacitated vertex \(p\)-center problem

0 references

Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent

0 references

Large-scale local search heuristics for the capacitated vertex<i>p</i>-center problem

0 references

New lower bounds for the facility location problem with clients’ preferences

0 references

Polyhedral study of simple plant location problem with order

0 references

Identifiers

10.1016/j.ejor.2022.09.019

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6106963

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6106963&oldid=37819532"