Polyhedral study of the capacitated vehicle routing problem (Q688914): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GAMS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: VRP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: The traveling salesman problem on a graph and some related integer polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of cutting planes for the symmetric travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem in graphs with some excluded minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Programming Approach to the Vehicle Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the symmetric travelling salesman problem: Solution of a 120-city problem / 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: Clique Tree Inequalities and the Symmetric Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5184698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751354 / 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: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the symmetric travelling salesman problem: A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of a 532-city symmetric traveling salesman problem by branch and cut / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01580599 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998205685 / rank
 
Normal rank

Latest revision as of 08:48, 30 July 2024

scientific article
Language Label Description Also known as
English
Polyhedral study of the capacitated vehicle routing problem
scientific article

    Statements

    Polyhedral study of the capacitated vehicle routing problem (English)
    0 references
    0 references
    0 references
    1 November 1993
    0 references
    polyhedron
    0 references
    facet
    0 references
    branch and cut
    0 references
    capacitated vehicle routing
    0 references
    central depot
    0 references
    total distance traveled
    0 references
    subtour elimination
    0 references
    comb inequalities
    0 references
    cutting plane algorithm
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references