IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v52y2000i2p325-348.html
   My bibliography  Save this article

The combinatorial complexity of masterkeying

Author

Listed:
  • Wolfgang Espelage
  • Egon Wanke

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

Suggested Citation

  • Wolfgang Espelage & Egon Wanke, 2000. "The combinatorial complexity of masterkeying," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 52(2), pages 325-348, November.
    • Handle: RePEc:spr:mathme:v:52:y:2000:i:2:p:325-348
    DOI: 10.1007/s001860000084
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860000084
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s001860000084?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:mathme:v:52:y:2000:i:2:p:325-348. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.