A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization (Q2883580): Difference between revisions
From MaRDI portal
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.endm.2010.05.044 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2007180585 / 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: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem / 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: A heuristic procedure for the capacitated \(m\)-ring-star problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An ILP improvement procedure for the open vehicle routing problem / rank | |||
Normal rank |
Latest revision as of 05:24, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization |
scientific article |
Statements
A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization (English)
0 references
13 May 2012
0 references
capacitated \(m\)-ring-star problem
0 references
variable neighborhood search
0 references
integer linear programming
0 references
networks
0 references