Exact algorithms for the equitable traveling salesman problem (Q1753595): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 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: LEMON / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: JGraphT / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2375089373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances / 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: Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5389837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: (1,2)-HAMILTONIAN COMPLETION ON A MATCHING / 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: Q3840366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for Solving Traveling-Salesman Problems / 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: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural and extended formulations for the time-dependent traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route / 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: 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: Balanced optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed Integer Linear Programming Formulation Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of maximum absolute deviation in integers / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:16, 15 July 2024

scientific article
Language Label Description Also known as
English
Exact algorithms for the equitable traveling salesman problem
scientific article

    Statements

    Exact algorithms for the equitable traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 May 2018
    0 references
    combinatorial optimization
    0 references
    traveling salesman problem
    0 references
    branch-and-bound
    0 references
    branch-and-price
    0 references
    exact algorithms
    0 references
    0 references
    0 references
    0 references

    Identifiers

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