Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme
From MaRDI portal
Publication:4124641
DOI10.1007/BF01918175zbMath0353.90095OpenAlexW2092218813MaRDI QIDQ4124641
Rainer E. Burkard, J. Offermann
Publication date: 1977
Published in: Zeitschrift für Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01918175
Related Items
Lower bounds for the quadratic assignment problem, A branch-and-cut algorithm for quadratic assignment problems based on linearizations, Multi-objective optimization of mobile phone keymaps for typing messages using a word list, Quadratic assignment problems, Characterizing linearizable QAPs by the level-1 reformulation-linearization technique, An LP-based characterization of solvable QAP instances with chess-board and graded structures, Discrete optimization: an Austrian view, Selected topics on assignment problems, Convergence of the surrogate Lagrangian relaxation method, Optimal electronic musical instruments, A parallel heuristic for quadratic assignment problems, Iterated local search for the quadratic assignment problem, A hybrid metaheuristic for the quadratic assignment problem, A contribution to quadratic assignment problems, Optimization of the keyboard arrangement problem using an ant colony algorithm., Optimizing simulated annealing schedules with genetic programming, The single-finger keyboard layout problem, A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases, Recent trends in combinatorial optimization, Linear programming insights into solvable cases of the quadratic assignment problem, QAPLIB-A quadratic assignment problem library, A heuristic for cyclic stochastic sequencing of tasks on a drum-like storage system
Cites Work
