.png){kind=icon}
返回
An integer programming column generation principle for heuristic search methods
.png){kind=icon}
OA
AI
DOI：10.1111/itor.12521.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
There is an increasing interest in integrating column generation and heuristic approaches to efficiently solve large-scale discrete optimisation problems. We contribute in this direction. Based on the insights from Lagrangian duality theory, we present an auxiliary problem that can be used for finding near-optimal solutions to a discrete column-oriented model. The structure of this auxiliary problem makes it suitable for being addressed with a heuristic search method involving column generation. To this end, we suggest a large neighbourhood search strategy where the repair step is to solve a column generation type subproblem. The suggested search strategy and mathematical models involved need to be tailored to the problem structure. To illustrate important design options and computational behaviour, four applications are studied: bin packing, generalised assignment, a resource allocation problem and the fixed-charge transportation problem.
Keyword:
integer programming
column generation
metaheuristics
matheuristics
large neighbourhood search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.9
论文数:
1.8K
被引数:
3.7K
机构
引用论文
.png){kind=icon}
分享收藏
A New Software Platform to Improve Multidisciplinary Tumor Board Workflows and User Satisfaction: A Pilot Study改善多学科肿瘤委员会工作流程和用户满意度的新软件平台: 一项试点研究OAAI
OAAI分享收藏
查看更多内容