A branch-and-cut algorithm for the balanced traveling salesman problem (Q6123381): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q129042105, #quickstatements; #temporary_batch_1724706784888
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Maximum Scatter Traveling Salesperson Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Most and least uniform spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced paths in acyclic networks: Tractable cases and related approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding most uniform spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Terminal Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for minimum range cut problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The balanced traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial algorithm for the uniform balanced network flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2865872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Gilmore-Gomory's open question for the bottleneck TSP. / rank
 
Normal rank

Latest revision as of 14:46, 27 August 2024

scientific article; zbMATH DE number 7812583
Language Label Description Also known as
English
A branch-and-cut algorithm for the balanced traveling salesman problem
scientific article; zbMATH DE number 7812583

    Statements

    A branch-and-cut algorithm for the balanced traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    4 March 2024
    0 references
    traveling salesman problem
    0 references
    balanced optimization
    0 references
    mixed-integer programming
    0 references
    branch-and-cut
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references