Using the analytic center in the feasibility pump
暂无分享,去创建一个
[1] Matteo Fischetti,et al. A feasibility pump heuristic for general mixed-integer problems , 2007, Discret. Optim..
[2] Yinyu Ye,et al. Interior point algorithms: theory and analysis , 1997 .
[3] Andrea Lodi,et al. MIPLIB 2010 , 2011, Math. Program. Comput..
[4] Java Binding,et al. GNU Linear Programming Kit , 2011 .
[5] Samir Elhedhli,et al. An interior point cutting plane heuristic for mixed integer programming , 2011, Comput. Oper. Res..
[6] John E. Mitchell,et al. Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems , 1997 .
[7] Michael J. Todd,et al. Solving combinatorial optimization problems using Karmarkar's algorithm , 1992, Math. Program..
[8] Hande Y. Benson. Mixed integer nonlinear programming using interior-point methods , 2011, Optim. Methods Softw..
[9] Stephen J. Wright,et al. PCx: an interior-point code for linear programming , 1999 .
[10] Matteo Fischetti,et al. Feasibility pump 2.0 , 2009, Math. Program. Comput..
[11] Fred W. Glover,et al. The feasibility pump , 2005, Math. Program..
[12] Gérard Cornuéjols,et al. An algorithmic framework for convex mixed integer nonlinear programs , 2008, Discret. Optim..
[13] Timo Berthold,et al. Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Improving the Feasibility Pump Improving the Feasibility Pump , 2022 .