Separating capacity constraints in the CVRP using tabu search (Q1609917): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(9 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: José-Manuel Belenguer / rank
Normal rank
 
Property / author
 
Property / author: Enrique Benavent / rank
Normal rank
 
Property / author
 
Property / author: Angel Corberán / rank
Normal rank
 
Property / author
 
Property / author: Denis Naddef / rank
Normal rank
 
Property / author
 
Property / author: José-Manuel Belenguer / rank
 
Normal rank
Property / author
 
Property / author: Enrique Benavent / rank
 
Normal rank
Property / author
 
Property / author: Angel Corberán / rank
 
Normal rank
Property / author
 
Property / author: Denis Naddef / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: VRP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating capacity constraints in the CVRP using tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the mixed Chinese postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A user's guide to tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Routing under Capacity and Distance Restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral study of the capacitated vehicle routing problem / 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
Property / cites work
 
Property / cites work: Q4840772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(97)00290-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055942436 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:17, 30 July 2024

scientific article
Language Label Description Also known as
English
Separating capacity constraints in the CVRP using tabu search
scientific article

    Statements

    Separating capacity constraints in the CVRP using tabu search (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 August 2002
    0 references
    capacitated vehicle routing problem
    0 references
    valid inequalities
    0 references
    separation
    0 references
    tabu search
    0 references
    heuristics
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers