Compact formulations of the Steiner traveling salesman problem and related problems (Q257227): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(8 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2013.01.044 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Concorde / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2116834205 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57702151 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1203.3854 / 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: The prize collecting traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461916 / 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 traveling salesman problem on a graph and some related integer polyhedra / 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: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inexact algorithm for the sequential ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane procedure for the travelling salesman problem on road networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on flows in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A classification of formulations for the (time-dependent) traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relation Between the Traveling-Salesman and the Longest-Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3274170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The travelling salesman problem as a constrained shortest path problem: Theory and computational experience / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the capacitated profitable tour problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting sparsity in pricing routines for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph / 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: Q4461904 / 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 fundamental problem in vehicle routing / 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: An analytical comparison of different formulations of the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3285992 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2013.01.044 / rank
 
Normal rank

Latest revision as of 12:46, 9 December 2024

scientific article
Language Label Description Also known as
English
Compact formulations of the Steiner traveling salesman problem and related problems
scientific article

    Statements

    Compact formulations of the Steiner traveling salesman problem and related problems (English)
    0 references
    0 references
    0 references
    0 references
    15 March 2016
    0 references
    traveling salesman problem
    0 references
    integer programming
    0 references
    combinatorial optimization
    0 references
    0 references
    0 references
    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
    0 references