An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem (Q439317): 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.2011.08.026 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2026808160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic algorithms for the multi-depot ring-star problem / 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: The Covering Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring relaxation induced neighborhoods to improve MIP solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new ILP-based refinement heuristic for vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column Generation Algorithms for the Capacitated m-Ring-Star 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 Ring Star Problem: Polyhedral analysis and exact algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating median cycles in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic procedure for the capacitated \(m\)-ring-star problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ILP improvement procedure for the open vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems / rank
 
Normal rank

Latest revision as of 14:12, 5 July 2024

scientific article
Language Label Description Also known as
English
An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
scientific article

    Statements

    An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem (English)
    0 references
    0 references
    0 references
    0 references
    16 August 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    capacitated \(m\)-ring-star problem
    0 references
    heuristic algorithms
    0 references
    local search
    0 references
    integer linear programming
    0 references
    variable neighborhood search
    0 references
    0 references
    0 references
    0 references
    0 references