数学
分类
列生成
数学优化
分支和切割
放松(心理学)
线性规划松弛
集合(抽象数据类型)
职位(财务)
变量(数学)
指数函数
整数规划
算法
计算机科学
经济
社会心理学
心理学
程序设计语言
数学分析
财务
作者
Samuel Deleplanque,Martine Labbé,Diego Ponce,Justo Puerto
标识
DOI:10.1287/ijoc.2019.0915
摘要
The discrete ordered median problem (DOMP) is formulated as a set-partitioning problem using an exponential number of variables. Each variable corresponds to a set of demand points allocated to the same facility with the information of the sorting position of their corresponding costs. We develop a column generation approach to solve the continuous relaxation of this model. Then we apply a branch-price-and-cut algorithm to solve small- to large-sized instances of DOMP in competitive computational time.
科研通智能强力驱动
Strongly Powered by AbleSci AI