Lower and upper bounds for the two-echelon capacitated location-routing problem (Q339668): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B06 / 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: 6651779 / rank
 
Normal rank
Property / zbMATH Keywords
 
two-echelon capacitated location routing problem
Property / zbMATH Keywords: two-echelon capacitated location routing problem / rank
 
Normal rank
Property / zbMATH Keywords
 
adaptive large neighbourhood search
Property / zbMATH Keywords: adaptive large neighbourhood search / rank
 
Normal rank
Property / zbMATH Keywords
 
branch-and-cut
Property / zbMATH Keywords: branch-and-cut / 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.2012.04.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2165941447 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q41763970 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Method for the Capacitated Location-Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut method for the Capacitated Location-Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Families of Valid Inequalities for the Two-Echelon Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general heuristic for vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Record breaking optimization results using the ruin and recreate principle / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:06, 12 July 2024

scientific article
Language Label Description Also known as
English
Lower and upper bounds for the two-echelon capacitated location-routing problem
scientific article

    Statements

    Identifiers