The undirected \(m\)-capacitated peripatetic salesman problem (Q2253380): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Concorde / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2012.07.022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074323873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loop based facility planning and material handling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the asymptotic optimality of an algorithm for solving the maximum \(m\)-PSP in a multidimensional Euclidean space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle scheduling in two-cycle flexible manufacturing systems / 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: Lower bounds for symmetric<i>K</i>-peripatetic salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for symmetric 2-peripatetic salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Undirected <i>m</i>-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equity constrained shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulating logical implications in combinatorial optimisation / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior point stabilization for column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for flow-path design of automated guided vehicle systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic approach to the overnight security service problem / rank
 
Normal rank

Latest revision as of 20:02, 8 July 2024

scientific article
Language Label Description Also known as
English
The undirected \(m\)-capacitated peripatetic salesman problem
scientific article

    Statements

    The undirected \(m\)-capacitated peripatetic salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    27 July 2014
    0 references
    peripatetic salesman problem
    0 references
    traveling salesman problem
    0 references
    capacity
    0 references
    branch-and-cut
    0 references
    branch-and-price
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers