期刊
MATHEMATICAL PROGRAMMING
卷 119, 期 2, 页码 331-352出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s10107-008-0212-2
关键词
-
类别
资金
- IBM
- ANR [BLAN06-1-138894]
- NSF [CMMI-0653419]
- ONR [N00014-03-1-0188]
- Office of Advanced Cyberinfrastructure (OAC)
- Direct For Computer & Info Scie & Enginr [0750826] Funding Source: National Science Foundation
We present an algorithm for finding a feasible solution to a convex mixed integer nonlinear program. This algorithm, called Feasibility Pump, alternates between solving nonlinear programs and mixed integer linear programs. We also discuss how the algorithm can be iterated so as to improve the first solution it finds, as well as its integration within an outer approximation scheme. We report computational results.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据