A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks (Q2835682): Difference between revisions

From MaRDI portal
Changed an 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: LEMON / 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-45587-7_23 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2511194182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the double traveling salesman problem with multiple stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The double traveling salesman problem with multiple stacks: A variable neighborhood search approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Lower Bounds for Polytopes in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extended formulations for the precedence constrained asymmetric traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the linear ordering polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact method for the double TSP with multiple stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved exact method for the double TSP with multiple stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets and lifting procedures for the set covering polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of set packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solutions to the double travelling salesman problem with multiple stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut solver for the maximum stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of the Multiple Stack TSP, kSTSP / rank
 
Normal rank

Latest revision as of 01:14, 13 July 2024

scientific article
Language Label Description Also known as
English
A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks
scientific article

    Statements

    A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 November 2016
    0 references
    double traveling salesman problem with multiple stacks
    0 references
    polytope
    0 references
    set cover
    0 references
    vertex cover
    0 references
    odd hole
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers