Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme
From MaRDI portal
Publication:4124641
Cites work
Cited in
(22)- Quadratic assignment problems
- Optimizing simulated annealing schedules with genetic programming
- An LP-based characterization of solvable QAP instances with chess-board and graded structures
- QAPLIB-A quadratic assignment problem library
- Selected topics on assignment problems
- A heuristic for cyclic stochastic sequencing of tasks on a drum-like storage system
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations
- Convergence of the surrogate Lagrangian relaxation method
- A hybrid metaheuristic for the quadratic assignment problem
- Linear programming insights into solvable cases of the quadratic assignment problem
- The single-finger keyboard layout problem
- Lower bounds for the quadratic assignment problem
- Optimal electronic musical instruments
- A parallel heuristic for quadratic assignment problems
- Multi-objective optimization of mobile phone keymaps for typing messages using a word list
- A novel SDP relaxation for the quadratic assignment problem using cut pseudo bases
- Iterated local search for the quadratic assignment problem
- Optimization of the keyboard arrangement problem using an ant colony algorithm.
- Recent trends in combinatorial optimization
- A contribution to quadratic assignment problems
- Discrete optimization: an Austrian view
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique
This page was built for publication: Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4124641)