A branch-and-price algorithm for the ring-tree facility location problem (Q2132327): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2977272969 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q113317431 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ring tree facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCIP: solving constraint integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Capacitated <i>m</i>-Ring-Star Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for Solving Traveling-Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-exchange Neighborhoods for the Capacitated Ring Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated ring arborescence problems with profits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for bi-objective ring tree problems with reliability measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal capacitated ring trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized local branching heuristics and the capacitated ring tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The school bus routing problem: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A column generation approach for a school bus routing problem with resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for two-level survivable network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation / rank
 
Normal rank

Latest revision as of 19:26, 28 July 2024

scientific article
Language Label Description Also known as
English
A branch-and-price algorithm for the ring-tree facility location problem
scientific article

    Statements

    A branch-and-price algorithm for the ring-tree facility location problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 April 2022
    0 references
    capacitated ring-tree problem
    0 references
    network design
    0 references
    integer programming
    0 references
    column generation
    0 references
    q-routes
    0 references

    Identifiers