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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(7 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2014.12.013 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B80 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6650913 / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial optimization
Property / zbMATH Keywords: combinatorial optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
discrete location
Property / zbMATH Keywords: discrete location / rank
 
Normal rank
Property / zbMATH Keywords
 
capacitated \(p\)-center problem
Property / zbMATH Keywords: capacitated \(p\)-center problem / rank
 
Normal rank
Property / zbMATH Keywords
 
metaheuristics
Property / zbMATH Keywords: metaheuristics / rank
 
Normal rank
Property / zbMATH Keywords
 
iterated greedy local search
Property / zbMATH Keywords: iterated greedy local search / rank
 
Normal rank
Property / zbMATH Keywords
 
variable neighborhood descent
Property / zbMATH Keywords: variable neighborhood descent / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / 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.cor.2014.12.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2167418772 / 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: A New Formulation and Resolution Method for the p-Center Problem / 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: Lagrangean duals and exact solution to the capacitated \(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 simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated greedy local search methods for unrelated parallel machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shifting representation search for hybrid flexible flowline problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location analysis: a synthesis and survey / 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: A branch‐and‐price algorithm for the capacitated <i>p</i>‐median problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2014.12.013 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:48, 9 December 2024

scientific article
Language Label Description Also known as
English
Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent
scientific article

    Statements

    Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent (English)
    0 references
    10 November 2016
    0 references
    combinatorial optimization
    0 references
    discrete location
    0 references
    capacitated \(p\)-center problem
    0 references
    metaheuristics
    0 references
    iterated greedy local search
    0 references
    variable neighborhood descent
    0 references

    Identifiers