Some recent contributions to network optimization

Networks

Volumn 44, Issue 1, 2004, Pages 27-30

  Ben Ameur, Walid ^a   Gouveia, Luis ^b  

^a INSTITUT NATIONAL DES TÉLÉCOMMUNICATIONS   (France)

^b UNIVERSITY OF LISBON   (Portugal)

Author keywords

Graphs; Mathematical programming; Network design; Network optimization; Pricing; Reliability; Routing; Survivability; Trees; Uncertainty; Wireless communications

Indexed keywords

ALGORITHMS; GRAPH THEORY; MATHEMATICAL PROGRAMMING; RELIABILITY; TELECOMMUNICATION NETWORKS; TREES (MATHEMATICS); WIRELESS TELECOMMUNICATION SYSTEMS;

NETWORK DESIGN; NETWORK OPTIMIZATION; PRICING; ROUTING; SURVIVABILITY; UNCERTAINTY; WIRELESS COMMUNICATIONS;

OPTIMIZATION;

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

References (37)

1. M. Abbas and Z. Benmeziane, Partly claw-free graphs.
2. J. Alber, N. Betzier, and R. Niedermeier, Experiments on data reduction for optimal domination in networks.
3. F. Alvelos and J.M.V. de Carvalho, Comparing branch-and-price algorithms for the unsplittable multicommodity flow problem.
4. P. Avella, M. Boccia, R. Canonico, D. Emma, A. Sforza, and G. Ventre, Web cache location and network design in VPNs.
5. F. Barahona, Separation of partition inequalities and their role in network design.
6. M. Belaidouni and W. Ben-Ameur, A superadditive approach to solve the minimum cost single path routing problem: preliminary results.
7. P. Belotti and F. Malucelli, A Lagrangian relaxation approach for the design of networks with shared protection.
8. W. Ben-Ameur and H. Kerivin, A polyhedral model to deal with uncertainty.
9. A. Bley, A Lagrangian approach for integrated network configuration and routing planning in IP networks.
10. N. Bourquia, W. Ben-Ameur, and E. Gourdin, Optimal shortest path routing for Internet networks.
11. P. Burgos, H. Cancela, A. Godoy, and L. Petingi, Network reliability optimization with source-terminal distance constraints.
12. C. Chekuri, W. Lee, and L. Zhang, Optical line system configuration via dynamic programming.
13. G. Dahl and N. Foldnes, A randomized algorithm for the multiple knapsack problem with assignment restrictions.
14. A. Farago, Route metrics: diversity and unification.
15. B. Fortz and M. Thorup, Robust optimization of OSPF/IS-IS weights.
16. R. Fukasawa, M. Poggi de Arago, O. Porto, and E. Uchoa, Robust branch-and-cut-and-price for the capacitated minimum spanning tree problem.
17. H. Geerdes and H. Karl, The potential of relaying in cellular networks.
18. T. Gomes and J. Craveirinha, An algorithm for obtaining the most reliable pair of link disjoint paths with length constraints.
19. L. Gouveia, T.L. Magnanti, and C. Requejo, An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees.
20. K.R. Hutson and D.R. Shier, Algorithms for the weight distribution of a minimum spanning tree in a stochastic network.
21. T. Koide, S. Shinmori, and H. Ishii, Reliability importance computation on all components in a network system.
22. H. Koskinen, A simulation-based method for predicting connectivity in ad hoc networks.
23. A. Kröller and R. Wessäly, Integrated optimization of hardware configuration and capacity dimensioning in SDH and opaque WDM networks.
24. B. Lardeux, A. Knippel, and J. Geffard, Efficient algorithms for solving the 2-layered network design problem.
25. A. Laugier and S. Petal, Network design and b-matching.
26. A.R. Mahjoub, Design of survivable networks.
27. M. Minoux, Discrete cost network optimization models and solution algorithm.
28. E. Monakhova, Optimal triple loop networks with given transmission delay: topological design and routing.
29. E. Mulyana and U. Killat, An offline hybrid IGP/MPLS traffic engineering approach under LSP constraints.
30. D. Nace and L.N. Doan, Some results on max-min fair routing.
31. S. Park, D. Kim, and K. Lee, Integer programming approach to the path selection problems.
32. M. Pérez, F. Almeida, and J.M. Vega, Path relinking for the p-hub median problem.
33. A. Quilliot, F. Mailfert, and J. Mailfert, Cooperative game models for pricing networks with elastic demands.
34. I. Rodríguez and J. Salazar, An exact algorithm for a capacitated hub problem.
35. H. Sakurai, S. Kasahara, and N. Adachi, Internet pricing and user opt-out strategy under two ISPs competition.
36. M.G. Scutella, A note on the parametric maximum flow problem and some related reoptimization issues.
37. Q.P. Thai, T.Q. Nguyen, and J.-L. Lutton, On solving network tariff-setting problem by D.C. programming approach.