MnM2

This instance is the same with MnM instance. However, for this instance, the MIP problem is solved by Cplex in python. Using data on "likes" from the Internet (e.g., epicurious.com), we create an objective function based on ideas from matrix completion (a Netflix competition), and then formulate a MIP problem whose objective is the sum of preferences of the roommates.

本实例与MnM实例完全一致。不过，本实例采用Python环境下的CPLEX求解器求解混合整数规划（Mixed Integer Programming，MIP）问题。我们利用来自互联网（如epicurious.com）的点赞数据，结合源自Netflix竞赛的矩阵补全（matrix completion）思路构建目标函数，随后构建以室友偏好总和为优化目标的混合整数规划问题。

搜集汇总

背景与挑战

背景概述

MnM2数据集与MnM实例相同，但使用Python中的Cplex解决MIP问题。该数据集基于互联网上的'likes'数据，利用矩阵补全思想构建目标函数，形成一个以室友偏好总和为目标的MIP问题。