Exact algorithms for a selective Vehicle Routing Problem where the longest route is minimized (Q2840529): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Cristiano Arbex Valle / rank
Normal rank
 
Property / author
 
Property / author: Geraldo Robson Mateus / rank
Normal rank
 
Property / author
 
Property / author: Leonardo Conegundes Martinez / rank
Normal rank
 
Property / author
 
Property / author: Cristiano Arbex Valle / rank
 
Normal rank
Property / author
 
Property / author: Geraldo Robson Mateus / rank
 
Normal rank
Property / author
 
Property / author: Leonardo Conegundes Martinez / 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.endm.2009.11.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2058800323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / 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: Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:18, 6 July 2024

scientific article
Language Label Description Also known as
English
Exact algorithms for a selective Vehicle Routing Problem where the longest route is minimized
scientific article

    Statements