This paper presents the results of the application of the modified Hopfield network to the travelling salesman problem (TSP). A cost function of the TSP consists of four components: two terms which ensure that the salesman's tour is valid, the term which forces neurons to have the output signal...

We develop a branch-and-price algorithm for constructing an optimal product line using partworth estimates from choice-based conjoint analysis. The algorithm determines the specific attribute levels for each multiattribute product in a set of products to maximize the resulting product line's...

We propose a new, easy-to-implement, class of payment rules, "Reference Rules," to make core-selecting package auctions more robust. Small, almost riskless, profitable deviations from "truthful bidding" are often easy for bidders to find under currently-used payment rules. Reference Rules...

Steuerung von Werkstattfertigungssystemen -- Modelle und Lösungsansätze zur Steuerung -- Neues Modell zur adaptiven Steuerung -- Konzept zur Steuerung -- Sequentielle und parallele Algorithmen für das neue Modell -- Analyse und exemplarische Validierung der neuen Algorithmen --...

Iterated Local Search has many of the desirable features of a metaheuristic: it is simple, easy to implement, robust, and highly effective. The essential idea of Iterated Local Search lies in focusing the search not on the full space of solutions but on a smaller subspace defined by the...