An approximation algorithm for the stack-up problem

Jochen Rethmann and Egon Wanke

Mathematical Methods of Operations Research, 2000, vol. 51, issue 2, 203-233

Abstract: We consider the combinatorial stack-up problem motivated by stacking up bins from a conveyor onto pallets. The stack-up problem is to decide whether a given list q of labeled objects can be processed by removing step by step one of the first s objects of q so that the following holds. After each removal there are at most p labels for which the first object is already removed from q and the last object is still contained in q. We give some NP-completeness results and we introduce and analyze a polynomial time approximation algorithm for the stack-up problem. Copyright Springer-Verlag Berlin Heidelberg 2000

Keywords: Key words: approximability; discrete algorithms; computational analysis; problem complexity (search for similar items in EconPapers)
Date: 2000
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860050085 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:51:y:2000:i:2:p:203-233

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860050085

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().