This paper considers the optimal communication spanning tree (OCST) problem. Previouswork analyzed features of high-quality solutions and found that edges in optimal solutions havelow weight and point towards the center of a tree. Consequently, integrating this problem-specific knowledge into a...

We study the Euclidean variant of the optimalcommunication spanning tree (OCST) problem. An experimentalanalysis reveals that edges in optimal trees do not only have lowdistance weights but also point with higher probability towardsthe graph’s center. Consequently, we use this characteristic...

This paper presents novel approaches for generating sequencing rules for the carsequencing (CS) problem in cases of two and multiple processing times per station.The CS problem decides on the succession of different car models launched down amixed-model assembly line. It aims to avoid work...

Rubik’s Cube is a popular three-dimensional mechanical puzzle developed inthe 1970’s. The aim of the puzzle is to restore a scrambled cube such that eachof the six faces of the cube is a solid color. This paper proposes an evolutionaryoptimization solver that finds a sequence of turns which...

The rapid development of Internet technologies has led to the emergence of e-business companies(EBCs). This paper investigates the foreign market entry mode choice of EBCs andseeks to address whether and how internationalization rules have changed for them. The evidenceof four selected cases of...

The amount of Internet sales has been growing at a high and constant rate over the last years. Many customers use Internet shops on a regular basis. Internet shops ensure a high transparency on product properties (including prices) and customers are able to easily compare a large number of...

While in the past decades research on multi-objective evolutionaryalgorithms (MOEA) has aimed at finding the wholeset of Pareto optimal solutions, current approaches focus ononly those parts of the Pareto front which satisfy the preferencesof the decision maker (DM). Therefore, they integratethe...

Until recently, multidimensional knapsack problems (MDKP)and winner determination problems (WDP) have been studiedindependently of each other, although WDPs can bemodelled as MDKPs. State-of-the-art optimization methodsfor WDPs are exact algorithms whereas MDKPs aremainly solved using heuristics...