SIAG/OPT Views-and-News A Forum for the SIAM Activity Group on Optimization

Optimizers in IndustryMy Experiences as an Industrial Research Mathe-maticianAndrew R. Conn 1An Optimizer in the Telecommunications IndustryMauricio G. C. Resende 8Bulletin 20Chairman’s ColumnKurt M. Anstreicher 22Comments from the EditorLu´is N. Vicente 23

[1]  Celso C. Ribeiro,et al.  Design of Survivable Networks: A survey , 2005 .

[2]  Celso C. Ribeiro,et al.  Local search with perturbations for the prize‐collecting Steiner tree problem in graphs , 2001, Networks.

[3]  David S. Johnson,et al.  The prize collecting Steiner tree problem: theory and practice , 2000, SODA '00.

[4]  Mikkel Thorup,et al.  Speeding Up Dynamic Shortest-Path Algorithms , 2008, INFORMS J. Comput..

[5]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[6]  Celso C. Ribeiro,et al.  GRASP with Path-Relinking: Recent Advances and Applications , 2005 .

[7]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[8]  Mikkel Thorup,et al.  Increasing Internet Capacity Using Local Search , 2004, Comput. Optim. Appl..

[9]  Pablo Moscato,et al.  A Gentle Introduction to Memetic Algorithms , 2003, Handbook of Metaheuristics.

[10]  Sandra Sudarsky,et al.  Massive Quasi-Clique Detection , 2002, LATIN.

[11]  Celso C. Ribeiro,et al.  A GRASP with path‐relinking for private virtual circuit routing , 2003, Networks.

[12]  Mauricio G. C. Resende,et al.  Strong lower bounds for the prize collecting Steiner problem in graphs , 2004, Discret. Appl. Math..

[13]  Panos M. Pardalos,et al.  A Genetic Algorithm for the Weight Setting Problem in OSPF Routing , 2002, J. Comb. Optim..

[14]  Renata Teixeira,et al.  TIE breaking: tunable interdomain egress selection , 2007, TNET.

[15]  David P. Williamson,et al.  Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.

[16]  Mauricio G. C. Resende,et al.  A Hybrid Heuristic for the p-Median Problem , 2004, J. Heuristics.

[17]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.