A k-means algorithm for clustering with hard and soft must-link and cannot-link constraints

Baumann, Philipp (2021). A k-means algorithm for clustering with hard and soft must-link and cannot-link constraints (Unpublished). In: International Conference on Operations Research. Universität Bern (Virtual Conference). 31. August - 03. September 2021.

Item Type:

Conference or Workshop Item (Speech)

Division/Institute:

03 Faculty of Business, Economics and Social Sciences > Department of Business Management > Institute of Financial Management > Professorship for Quantitative Methods in Business Administration

UniBE Contributor:

Baumann, Philipp

Subjects:

600 Technology > 650 Management & public relations

Language:

English

Submitter:

Nina Ackermann

Date Deposited:

29 Apr 2022 13:31

Last Modified:

29 Apr 2022 13:31

URI:

https://boris.unibe.ch/id/eprint/165838

Actions (login required)

Edit item Edit item
Provide Feedback