Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm (Q4994165): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(6 intermediate revisions by 5 users not shown)
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: CVRPSP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3020867067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the asymmetric travelling salesman problem with time windows by branch-and-cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified exact method for solving different classes of vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm / 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: Multi-depot multiple TSP: a polyhedral study and computational results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and solving the mixed capacitated general routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of variants and extensions of the location-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the Asymmetric Traveling Salesman Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polyhedral Approach to the Asymmetric Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems / 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: Q3714900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems / 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: Multistars, partial multistars and 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 / cites work
 
Property / cites work: New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combined location-routing problems: A synthesis and future research directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location-routing: issues, models and methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource constrained routing and scheduling: review and research prospects / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of recent research on location-routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the standard location-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New path elimination constraints for multi-depot routing problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 11:50, 4 December 2024

scientific article; zbMATH DE number 7360285
Language Label Description Also known as
English
Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm
scientific article; zbMATH DE number 7360285

    Statements

    Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm (English)
    0 references
    17 June 2021
    0 references
    branch-and-cut
    0 references
    valid inequalities
    0 references
    asymmetric
    0 references
    multidepot
    0 references
    vehicle routing
    0 references
    upper-bound procedure
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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