Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme
From MaRDI portal
Publication:4124641
DOI10.1007/BF01918175zbMATH Open0353.90095OpenAlexW2092218813MaRDI QIDQ4124641FDOQ4124641
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
Cites Work
Cited In (22)
- Discrete optimization: an Austrian view
- Selected topics on assignment problems
- Optimal electronic musical instruments
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations
- An LP-based characterization of solvable QAP instances with chess-board and graded structures
- Linear programming insights into solvable cases of the quadratic assignment problem
- Multi-objective optimization of mobile phone keymaps for typing messages using a word list
- A heuristic for cyclic stochastic sequencing of tasks on a drum-like storage system
- 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 parallel heuristic for quadratic assignment problems
- A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases
- QAPLIB-A quadratic assignment problem library
- A contribution to quadratic assignment problems
- Iterated local search for the quadratic assignment problem
- A hybrid metaheuristic for the quadratic assignment problem
- Recent trends in combinatorial optimization
- Convergence of the surrogate Lagrangian relaxation method
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique
- Quadratic assignment problems
- Lower bounds for the quadratic assignment problem
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)