The combinatorial complexity of masterkeying

Wolfgang Espelage and Egon Wanke

Mathematical Methods of Operations Research, 2000, vol. 52, issue 2, 325-348

Abstract: We consider the combinatorial complexity of the algorithmic design of mechanical master key locking systems. Such locking systems use pin tumblers and profile elements (wards) to realize the functional dependencies given by a key/cylinder matrix. We prove that even very restricted versions of the masterkeying problem are NP-complete. We show that the general masterkeying problem can be defined by an integer linear program whose number of variables and restrictions is polynomial in the size of the key/cylinder matrix and the size of the locking system. Heuristic solutions are also discussed. Copyright Springer-Verlag Berlin Heidelberg 2000

Keywords: Key words: problem complexity; musterkeying (search for similar items in EconPapers)
Date: 2000
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860000084 (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:52:y:2000:i:2:p:325-348

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

DOI: 10.1007/s001860000084

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 ().