Lagrangean duals and exact solution to the capacitated \(p\)-center problem (Q1044136): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2009.02.022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2025917696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximation algorithms for clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Allocate Network Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch‐and‐price algorithm for the capacitated <i>p</i>‐median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid scatter search and path relinking for the capacitated \(p\)-median problem / 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: An effective VNS for the capacitated \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangean heuristic for the maximal covering location problem / 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: The Capacitated <i>K</i>-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A column generation approach to capacitated \(p\)-median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated clustering problems by hybrid simulated annealing and tabu 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: Large-scale local search heuristics for the capacitated vertex<i>p</i>-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A scatter search heuristic for the capacitated clustering problem / rank
 
Normal rank

Latest revision as of 07:29, 2 July 2024

scientific article
Language Label Description Also known as
English
Lagrangean duals and exact solution to the capacitated \(p\)-center problem
scientific article

    Statements

    Lagrangean duals and exact solution to the capacitated \(p\)-center problem (English)
    0 references
    0 references
    0 references
    0 references
    10 December 2009
    0 references
    0 references
    discrete location
    0 references
    capacitated \(p\)-center
    0 references
    Lagrangean relaxation
    0 references
    0 references