Algorithms for a multi-level network optimization problem

DOI10.1016/S0377-2217(98)00306-3zbMath0944.90010OpenAlexW2048726843MaRDI QIDQ1307817

Frederico R. B. Cruz, Geraldo Robson Mateus, James MacGregor Smith

Publication date: 4 May 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00306-3

zbMATH Keywords

network programmingbranch-and-boundnetwork flowslocationtopological network design

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items

A facility location model for logistics systems including reverse flows: the case of remanufacturing activities, Parallel algorithms for a multi-level network optimization problem, Flow constrained minimum cost flow problem, Natural gas cash-out problem: bilevel stochastic optimization approach, A meta-heuristic approach for solving the urban network design problem

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A heuristic lagrangean algorithm for the capacitated plant location problem
• Models for planning capacity expansion in local access telecommunication networks
• A method for solving to optimality uncapacitated location problems
• The hierarchical network design problem
• The telephonic switching centre network problem: Formalization and computational experience
• Reducing the hierarchical network design problem
• A tree search algorithm for the p-median problem
• Topological design of telecommunication networks --- local access design methods
• An approach for the Steiner problem in directed graphs
• Topological design of computer communication networks -- the overall design problem
• Solving to optimality the uncapacitated fixed-charge network flow problem
• The Steiner tree polytope and related polyhedra
• A branch-and-bound algorithm to solve a multi-level network optimization problem
• A dual ascent approach for steiner tree problems on a directed graph
• Heuristics with Constant Error Guarantees for the Design of Tree Networks
• An SST-based algorithm for the steiner problem in graphs
• Networks synthesis and optimum network design problems: Models, solution methods and applications
• Reduction tests for the steiner problem in grapsh
• Analysis of a flow problem with fixed charges
• A Dual-Based Procedure for Uncapacitated Facility Location
• An integer linear programming approach to the steiner problem in graphs
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Tabu Search—Part I
• Tabu Search—Part II
• Using a Hop-Constrained Model to Generate Alternative Communication Network Design
• Multicommodity Distribution System Design by Benders Decomposition
• A Dual-Based Algorithm for Multi-Level Network Design
• Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
• When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
• The Traveling-Salesman Problem and Minimum Spanning Trees