Skip to main content
Conference Proceedings

A new lower bound for the block relocation problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2018) 11184 LNCS 168-174
DOI: 10.1007/978-3-030-00898-7_10
5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we deal with the restricted Block (or Container) Relocation Problem. We present a polynomial time algorithm to calculate a new lower bound for the problem.

Author supplied keywords

Cite

CITATION STYLE

APA

Bacci, T., Mattia, S., & Ventura, P. (2018). A new lower bound for the block relocation problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11184 LNCS, pp. 168–174). Springer Verlag. https://doi.org/10.1007/978-3-030-00898-7_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free