New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem (Q537638): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Sarin, Subhash C. / rank
Normal rank
 
Property / author
 
Property / author: Sarin, Subhash C. / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5898459 / rank
 
Normal rank
Property / zbMATH Keywords
 
high multiplicity asymmetric traveling salesman problem
Property / zbMATH Keywords: high multiplicity asymmetric traveling salesman problem / rank
 
Normal rank
Property / zbMATH Keywords
 
polynomial-length formulation
Property / zbMATH Keywords: polynomial-length formulation / rank
 
Normal rank
Property / zbMATH Keywords
 
Chesapeake problem
Property / zbMATH Keywords: Chesapeake problem / rank
 
Normal rank
Property / zbMATH Keywords
 
parallel machine scheduling
Property / zbMATH Keywords: parallel machine scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
lot-sizing
Property / zbMATH Keywords: lot-sizing / 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/s11590-010-0205-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034550441 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling Salesman Problem with Many Visits to Few Cities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete lot-sizing and scheduling problem with sequence-dependent setup costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the high multiplicity traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous lotsizing and scheduling on parallel machines / 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: A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:41, 4 July 2024

scientific article
Language Label Description Also known as
English
New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem
scientific article

    Statements

    New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem (English)
    0 references
    0 references
    0 references
    0 references
    20 May 2011
    0 references
    0 references
    high multiplicity asymmetric traveling salesman problem
    0 references
    polynomial-length formulation
    0 references
    Chesapeake problem
    0 references
    parallel machine scheduling
    0 references
    lot-sizing
    0 references
    0 references