Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem (Q704117): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.2003.09.024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2025661878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3470493 / 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: On the generalized 2-peripatetic salesman problem / 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: Q3714900 / 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: Q3714901 / 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: A heuristic approach to the overnight security service problem / rank
 
Normal rank

Latest revision as of 17:19, 7 June 2024

scientific article
Language Label Description Also known as
English
Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem
scientific article

    Statements

    Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem (English)
    0 references
    0 references
    0 references
    0 references
    12 January 2005
    0 references
    0 references
    Peripatetic Salesman Problem
    0 references
    Traveling Salesman Problem
    0 references
    Branch-and-cut
    0 references
    0 references