A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem

Networks

Volumn 44, Issue 2, 2004, Pages 61-72

  Fischetti, Matteo ^a   Polo, Carlo ^a   Scantamburlo, Massimo ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

Facility location problems; Heuristics; Mixed integer programs

Indexed keywords

BIBLIOGRAPHIES; COMPUTATIONAL METHODS; DECISION MAKING; HEURISTIC METHODS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; PARAMETER ESTIMATION; PROBLEM SOLVING; SET THEORY;

BINARY VARIABLES; FACILITY LOCATION PROBLEMS; MIXED-INTEGER PROGRAMS; VARIABLE NEIGHBORHOOD SEARCH (VNS);

TELECOMMUNICATION NETWORKS;

EID: 4444235806     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.20017     Document Type: Article

References (20)

1. E. Amaldi, A. Capone, and F. Malucelli, Planning UMTS Base Station Location: Optimization models with power control and algorithms, Technical Report, University of Milano, 2002.
2. A. Balakrishnan, T.L. Magnanti, and P. Mirchandani, "Network design," Annotated bibliographies in combinatorial optimization, M. DellAmico, F. Maffioli, S. Martello (Editors), Wiley, New York, 1997, pp. 311-334.
3. E. Balas and C.H. Martin, Pivot-and-complement: A heuristic for 0-1 programming, Manage Sci 26 (1980), 86-96.
4. E. Balas, S. Ceria, M. Dawande, F. Margot, and G. Pataki, OCTANE: A new heuristic for pure 0-1 programs, Operat Res 49 (2001), 207-225.
5. Cplex, ILOG Cplex 7.0 user's manual and reference manual, ILOG, S.A., 2001 (http://www.ilog.com).
6. M. Fischetti and A. Lodi, Local branching, Math Program Ser B, 98 (2003), 23-47.
7. M. Fischetti, G. Romanin Jacur, and J.J. Salazar Gonzáles, Optimization of the interconnecting network of a UMTS radio mobile telephone system, Eur J Operat Res 144 (2003), 56-67.
8. F. Glover and M. Laguna, General purpose heuristics for integer programming: Part I. J Heurist 2 (1997), 343-358.
9. F. Glover and M. Laguna, General purpose heuristics for integer programming: Part II. J Heurist 3 (1997), 161-179.
10. F. Glover and M. Laguna, Tabu search, Kluwer Academic Publisher, Boston, 1997.
11. F.S. Hillier, Efficient heuristic procedures for integer linear programming with an interior, Operat Res 17 (1969), 600-637.
12. T. Ibaraki, T. Ohashi, and H. Mine, A heuristic algorithm for mixed-integer programming problems, Math Program Study 2 (1974), 115-136.
13. M. Labbé́ and F.L. Louveaux, Location problems, Annotated bibliographies in combinatorial optimization, M. Dell-Amico, F. Maffioli, S. Martello (Editors), Wiley, New York, 1997, pp. 261-281.
14. A. Laspertini, Third-generation mobile telephone systems: Optimal design of the interconnecting network, Master Dissertation, University of Padova, Italy, 1997 (in Italian).
15. A. Løkketangen, Heuristics for 0-1 mixed-integer programming, Handbook of applied optimization, P.M. Pardalos and M.G.C. Resende (Editors), Oxford University Press, New York, 2002, pp. 470-477.
16. A. Løkketangen and F. Glover, Solving zero/one mixed integer programming problems using tabu search, Eur J Operat Res 106 (1998), 624-658.
17. N. Mladenovíc and P. Hansen, Variable neighborhood search, Comput Operat Res 24 (1997), 1097-1100.
18. M. Nediak and J. Eckstein, Pivot, cut, and dive: A heuristic for 0-1 mixed integer programming, Research Report RRR 53-2001, RUTCOR, Rutgers University, October 2001.
19. C. Polo, Heuristic methods for the optimal design of the interconnecting network in a UMTS radio mobile telephone system, Master Degree thesis, University of Padova, 2002 (in Italian).
20. H. Yaman, Concentrator location in telecommunication network, Master Dissertation, University of Bruxelles, 2002.