A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem (Q1681265): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2017.07.056 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q3425132 / 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: 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: Multi-depot multiple TSP: a polyhedral study and computational results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Formulation for the Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The exact solution of several classes of inventory-routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: In Pursuit of the Traveling Salesman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hybrid electric vehicle-traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3475129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An <i>n</i>-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3508462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimisation of maintenance routing and scheduling for offshore wind farms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer linear programming formulations of multiple salesman problems and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of travelling salesman problem formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem: An overview of exact and approximate algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative analysis of several asymmetric traveling salesman problem formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analytical comparison of different formulations of the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3583114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed integer linear programming model for multi-commodity multi-depot inventory routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: The General Pickup and Delivery Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models, relaxations and exact approaches for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2017.07.056 / rank
 
Normal rank

Latest revision as of 03:04, 11 December 2024

scientific article
Language Label Description Also known as
English
A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem
scientific article

    Statements

    A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem (English)
    0 references
    0 references
    23 November 2017
    0 references
    travelling salesman
    0 references
    node current
    0 references
    integer programming
    0 references
    fixed-destination problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers