A new mathematical programming formulation for the single-picker routing problem (Q323113): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2016.02.018 / 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.1016/j.ejor.2016.02.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2276677420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order batching in walk-and-pick order picking systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Formulation for 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 travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research on warehouse operation: a comprehensive review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search heuristics for the order batching problem in manual order picking systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch picking in narrow-aisle order picking systems with consideration for picker blocking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and control of warehouse order picking: a literature review / 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: Compact formulations of the Steiner traveling salesman problem and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5392120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative analysis of several asymmetric traveling salesman problem formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analytical comparison of different formulations of the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traveling salesman problem heuristics: leading methods, implementations and latest advances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing order pickers in a warehouse with a middle aisle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing methods for warehouses with multiple cross aisles / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2016.02.018 / rank
 
Normal rank

Latest revision as of 14:24, 9 December 2024

scientific article
Language Label Description Also known as
English
A new mathematical programming formulation for the single-picker routing problem
scientific article

    Statements

    A new mathematical programming formulation for the single-picker routing problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 October 2016
    0 references
    traveling salesman
    0 references
    order picking
    0 references
    picker routing
    0 references
    0 references

    Identifiers