Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Tree based heuristics for the preemptive asymmetric stacker crane problem

From MaRDI portal
Publication:2883548
Jump to:navigation, search

DOI10.1016/j.endm.2010.05.006zbMath1237.90269OpenAlexW2087421933MaRDI QIDQ2883548

Mathieu Lacroix, Hélène Toussaint, Alain Quilliot, Hervé L. M. Kerivin

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.006


zbMATH Keywords

local searchroutingpreemptive stacker crane problemreloadsheuristic design


Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)


Related Items (1)

Preemptive stacker crane problem: extending tree-based properties and construction heuristics




Cites Work

  • Nonpreemptive Ensemble Motion Planning on a Tree
  • Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
  • Preemptive Ensemble Motion Planning on a Tree




This page was built for publication: Tree based heuristics for the preemptive asymmetric stacker crane problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2883548&oldid=15834041"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 19:31.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki