Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem (Q323162): 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.2016.02.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2262003201 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Design Using Cut Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hamiltonian p-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new variant of a vehicle routing problem: Lower and upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hamiltonian \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of several models for the hamiltonian <i>p</i>‐median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Models for and Numerical Tests of the Hamiltonian p-Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—One-Dimensional Facility Location-Allocation using Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Staged Primal-Dual Algorithm for Perfect b-Matching with Edge Capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and effective evolutionary algorithm for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the design of network topologies with balanced disjoint rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422825 / rank
 
Normal rank

Latest revision as of 17:16, 12 July 2024

scientific article
Language Label Description Also known as
English
Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem
scientific article

    Statements

    Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem (English)
    0 references
    0 references
    0 references
    7 October 2016
    0 references
    Hamiltonian
    0 references
    \(p\)-median
    0 references
    branch-and-cut
    0 references
    metaheuristic
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references