A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex (Q1577763): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A mixed integer programming model for scheduling orders in a steel mill / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steel production schedule generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Simple Applications of the Travelling Salesman Problem / 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: The traveling salesman problem: An overview of exact and approximate algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3829370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3829367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation / rank
 
Normal rank

Latest revision as of 12:20, 30 May 2024

scientific article
Language Label Description Also known as
English
A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex
scientific article

    Statements

    A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 November 2003
    0 references
    iron and steel industry
    0 references
    hot rolling production
    0 references
    scheduling
    0 references
    multiple traveling salesman problem
    0 references
    genetic algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references