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

An approximation algorithm for the stack-up problem

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

DOI10.1007/S001860050085zbMath0971.90074OpenAlexW2097535162MaRDI QIDQ1574533

Jochen Rethmann, Egon Wanke

Publication date: 10 August 2000

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001860050085


zbMATH Keywords

discrete algorithmscomputational analysisapproximabilityproblem complexity


Mathematics Subject Classification ID

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


Related Items (4)

Directed Pathwidth and Palletizers ⋮ A Practical Approach for the FIFO Stack-Up Problem ⋮ Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms ⋮ On the complexity of the FIFO stack-up problem







This page was built for publication: An approximation algorithm for the stack-up problem

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