A binary linear programming-based k-means algorithm for clustering with must-link and cannot-link constraints.

Baumann, Philipp (2020). A binary linear programming-based k-means algorithm for clustering with must-link and cannot-link constraints. (Unpublished). In: IEEM International Conference on Industrial Engineering and Engineering Management (IEEM). Virtual Conference. 14.-17. December 2020.

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:

23 Jul 2021 10:23

Last Modified:

23 Jul 2021 10:23

URI:

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

Actions (login required)

Edit item Edit item
Provide Feedback