Order problem

An order problem is an optimization problem , one solution to such a problem being a permutation of a set . Correspondingly, the domain of a value landscape of a sequence problem s is the set of all permutations of . The neighborhood function is then often chosen so that two permutations are considered to be adjacent if the entries in only two places of one permutation have to be exchanged in order to obtain the other permutation. (So ​​(1, 2 , 3, 4, 5 ) is for example adjacent to (1, 5 , 3, 4, 2 ).) ${\displaystyle M}$ ${\displaystyle D}$ ${\displaystyle M}$

To order problems include:

• the traveling salesman problem
• the one-dimensional packing problem , Tetris problem
• Scheduling problems (what should be done when)
• sort by