The double traveling salesman problem with multiple stacks: A variable neighborhood search approach (Q1025245): 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: Angel Felipe / rank
Normal rank
 
Property / author
 
Property / author: Angel Felipe / 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.2009.01.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2068330535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metaheuristics for the vehicle routing problem with loading constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:05, 1 July 2024

scientific article
Language Label Description Also known as
English
The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
scientific article

    Statements

    The double traveling salesman problem with multiple stacks: A variable neighborhood search approach (English)
    0 references
    0 references
    0 references
    0 references
    18 June 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    traveling salesman problem
    0 references
    variable neighborhood search
    0 references
    LIFO loading
    0 references
    0 references