Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations (Q337182): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q125739974, #quickstatements; #temporary_batch_1714786519576
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Aircraft Landings—The Static Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total completion time subject to release dates and sequence-dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling tasks with sequence-dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying the corridor method to a blocks relocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments / 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: Q2767230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tree search procedure for the container relocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2867371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimization approach for planning daily drayage operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer linear programming formulations of multiple salesman problems and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A crane scheduling method for port container terminals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and solving several classes of arc routing problems as traveling salesman problems / 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: Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Are stacker crane problems easy? A statistical study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operations research at container terminals: a literature update / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Experience with an <i>M</i>-Salesman Traveling Salesman Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Container terminal operation and operations research -- a classification and literature review / rank
 
Normal rank

Latest revision as of 21:49, 12 July 2024

scientific article
Language Label Description Also known as
English
Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations
scientific article

    Statements

    Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    combinatorial optimization
    0 references
    crane scheduling
    0 references
    container stacking
    0 references
    mixed integer program
    0 references
    stacker crane problem
    0 references
    0 references
    0 references

    Identifiers