Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm (Q1622797): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2018.08.034 / rank
Normal rank
 
Property / author
 
Property / author: Luís Gouveia / rank
Normal rank
 
Property / author
 
Property / author: Luís Gouveia / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CVRPSP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2888929375 / 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: Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing / 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: Polyhedral results for a vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edmonds polytopes and weakly hamiltonian graphs / 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: Multi-Terminal Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time separation of enhanced reverse multistar inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of large-scale symmetric travelling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the symmetric travelling salesman problem I: Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-objective vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5184698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistars, partial multistars and the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection results for vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stronger multi-commodity flow formulations of the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new branch-and-cut algorithm for the capacitated vehicle routing problem / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129318084 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2018.08.034 / rank
 
Normal rank

Latest revision as of 23:16, 10 December 2024

scientific article
Language Label Description Also known as
English
Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm
scientific article

    Statements

    Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm (English)
    0 references
    0 references
    0 references
    19 November 2018
    0 references
    routing
    0 references
    balanced
    0 references
    polyhedral study
    0 references
    branch-and-cut algorithm
    0 references

    Identifiers