In this paper, a new model for the semi-obnoxious facility location problem is introduced. The new model is composed of a weighted minisum function to represent the transportation...
This paper describes how to solve very large TravelingSalesman Problems heuristically by the parallelization of self-organizing maps on cluster architectures. The used way of para...
Hannes Schabauer, Erich Schikuta, Thomas Weish&aum...
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
Abstract. The strategic supply chain design problem which allows capacity shifts and budget limitations can be formulated as a linear program. Since facilities are allowed to be op...