Strengthening integrality gaps for capacitated network design and covering problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Tabu Search for a Network Loading Problem with Multiple Facilities
Journal of Heuristics
Capacity and flow assignment of data networks by generalized Benders decomposition
Journal of Global Optimization
Cutting planes in integer and mixed integer programming
Discrete Applied Mathematics
Bidirected and unidirected capacity installation in telecommunication networks
Discrete Applied Mathematics - International symposium on combinatorial optimisation
Design of capacitated survivable networks with a single facility
IEEE/ACM Transactions on Networking (TON)
Appia: Automatic Storage Area Network Fabric Design
FAST '02 Proceedings of the 1st USENIX Conference on File and Storage Technologies
Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
Operations Research
A survey on benders decomposition applied to fixed-charge network design problems
Computers and Operations Research
An Adaptive Memory-Based Approach Based on Partial Enumeration
Learning and Intelligent Optimization
0-1 reformulations of the multicommodity capacitated network design problem
Discrete Applied Mathematics
Benders, metric and cutset inequalities for multicommodity capacitated network design
Computational Optimization and Applications
Algorithms for the non-bifurcated network design problem
Journal of Heuristics
A capacity scaling heuristic for the multicommodity capacitated network design problem
Journal of Computational and Applied Mathematics
Integration of equipment constraints in the network topology design process
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Appia: automatic storage area network fabric design
FAST'02 Proceedings of the 1st USENIX conference on File and storage technologies
A polyhedral approach for solving two facility network design problem
INOC'11 Proceedings of the 5th international conference on Network optimization
An iterated local search heuristic for a capacitated hub location problem
HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
Designing data storage tier using Integer Programing
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Metric inequalities and the Network Loading Problem
Discrete Optimization
Using mixed-integer programming to solve power grid blackout problems
Discrete Optimization
Exact solution of multicommodity network optimization problems with general step cost functions
Operations Research Letters
Operations Research Letters
Canonical dual approach to solving the maximum cut problem
Journal of Global Optimization
The robust network loading problem with dynamic routing
Computational Optimization and Applications
Design of Survivable Networks Using Three-and Four-Partition Facets
Operations Research
| Hi-index | 0.00 |
We study the network loading problem, with and without bifurcations. We use a relaxation based on the cut condition for multicommodity flows. We use a solution of the bifurcated case to derive a solution to the nonbifurcated problem. A standard procedure is to aggregate the problem into a backbone network. We applied this method to backbone networks coming from practical instances; we obtained feasible solutions and bounds for the gap from optimality.}