A local branching heuristic for mixed‐integer programs with 2‐level variables, with an application to a telecommunication network design problem
暂无分享,去创建一个
Matteo Fischetti | Carlo Polo | Massimo Scantamburlo | M. Fischetti | C. Polo | Massimo Scantamburlo
[1] Hisashi Mine,et al. A heuristic algorithm for mixed-integer programming problems , 1974 .
[2] Fred W. Glover,et al. General Purpose Heuristics for Integer Programming—Part II , 1997, J. Heuristics.
[3] Fred W. Glover,et al. General purpose heuristics for integer programming—Part I , 1997, J. Heuristics.
[4] Matteo Fischetti,et al. Local branching , 2003, Math. Program..
[5] Mauro Dell'Amico,et al. Annotated Bibliographies in Combinatorial Optimization , 1997 .
[6] Matteo Fischetti,et al. Optimisation of the interconnecting network of a UMTS radio mobile telephone system , 2003, Eur. J. Oper. Res..
[7] Frederick S. Hillier,et al. Efficient Heuristic Procedures for Integer Linear Programming with an Interior , 1969, Oper. Res..
[8] Edoardo Amaldi,et al. Planning UMTS base station location: optimization models with power control and algorithms , 2003, IEEE Trans. Wirel. Commun..
[9] E. Balas,et al. Pivot and Complement–A Heuristic for 0-1 Programming , 1980 .
[10] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.
[11] Egon Balas,et al. Octane: A New Heuristic for Pure 0-1 Programs , 2001, Oper. Res..
[12] Fred W. Glover,et al. Solving zero-one mixed integer programming problems using tabu search , 1998, European Journal of Operational Research.