The Secret Life of Keys: On the Calculation of Mechanical Lock Systems

DOI10.1137/15M1030054zbMath1370.90232MaRDI QIDQ5738136

Flavio de Lorenzi, Erwin Fuchs, Christof Vömel, Samuel Beer

Publication date: 31 May 2017

Published in: SIAM Review (Search for Journal in Brave)

zbMATH Keywords

global optimizationcombinatorial optimizationsimulated annealingartificial intelligenceNP-completenessrandomized algorithmdirected acyclic graphsemilatticeheuristicalgebraic modelsubgraph isomorphismmathematics in industrycylinder locklock system

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Randomized algorithms (68W20) Semilattices (06A12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants, Finding subgraphs with side constraints

Uses Software

• MUMPS
• Genocop
• Stony Brook
• CLIPS
• Tabu search
• Boost
• BGL

Cites Work

• Optimization by Simulated Annealing
• The complexity of embedding orders into small products of chains
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• The representation of posets and lattices by sets
• Global optimization and simulated annealing
• Computational aspects of the 2-dimension of partially ordered sets
• Stochastic Optimization
• THE LOGIC OF PARTITIONS: INTRODUCTION TO THE DUAL OF THE LOGIC OF SUBSETS
• Generalized Polychotomic Encoding: A Very Short Bit-Vector Encoding of Tree Hierarchies
• Three Partition Refinement Algorithms
• An Algorithm for Subgraph Isomorphism
• Task Scheduling in an Asynchronous Distributed Memory Multifrontal Solver
• Facts, Conjectures, and Improvements for Simulated Annealing
• An Introduction to Statistical Learning
• Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
• Elements of Information Theory
• The Transitive Reduction of a Directed Graph
• Maximum distance<tex>q</tex>-nary codes
• Combinatorial optimization. Theory and algorithms.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item