#### Filter Results:

- Full text PDF available (11)

#### Publication Year

2000

2014

- This year (0)
- Last 5 years (8)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Immanuel M. Bomze, Marcello Pelillo, Volker Stix
- IEEE Trans. Neural Netw. Learning Syst.
- 2000

Given an undirected graph with weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having the largest total weight. This is a generalization of the classical problem of finding the maximum cardinality clique of an unweighted graph, which arises as a special case of the MWCP… (More)

- Volker Stix
- Comp. Opt. and Appl.
- 2004

Clustering applications dealing with perception based or biased data lead to models with non-disjunct clusters. There, objects to be clustered are allowed to belong to several clusters at the same time which results in a fuzzy clustering. It can be shown that this is equivalent to searching all maximal cliques in dynamic graphs like Gt = (V,Et), where Et−1… (More)

- Edward Bernroider, Volker Stix
- Decision Support Systems
- 2006

This article addresses the area of decision making for information systems (IS). We recognize the great demand for methods and techniques that can be of practical help by presenting a new, conceptual approach, the profile distance method, to support the IS selection problem. This approach combines the merits of two prominent concepts individually applied in… (More)

- Edward Bernroider, Volker Stix
- Computers & OR
- 2007

In this empirical study a concept map is reorganized and clustered in order to provide an intuitive structure for browsing. The concepts are represented as nodes created by the authors of articles but also by readers of these articles. Semantic dependencies are coded through links between the nodes to build a graph. We report an experiment in which such a… (More)

- Volker Stix
- J. Global Optimization
- 2003

We introduce a very simple but efficient idea for branch and bound (B&B) algorithms in global optimization (GO). As input for our generic algorithm, we need an upper bound algorithm for the GO maximization problem and a branching rule. The latter reduces the problem into several smaller subproblems of the same type. The new B&B approach delivers one global… (More)

- Edward Bernroider, Stefan Koch, Volker Stix
- IS Management
- 2013

- Edward Bernroider, Stefan Koch, Volker Stix
- EGOVIS
- 2010

- Edward Bernroider, Konradin Maier, Volker Stix
- BIS
- 2010

- Martina Maida, Konradin Maier, Nikolaus Obwegeser, Volker Stix
- EC-Web
- 2012