Algorithms for the non-bifurcated network design problem
From MaRDI portal
Publication:2271128
DOI10.1007/s10732-008-9091-1zbMath1172.90330OpenAlexW2071407655MaRDI QIDQ2271128
Enrico Bartolini, Aristide Mingozzi
Publication date: 6 August 2009
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-008-9091-1
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The convex hull of two core capacitated network design problems
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks
- Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks
- Minimum cost capacity installation for multicommodity network flows
- Bidirected and unidirected capacity installation in telecommunication networks.
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- Polyhedral results for the edge capacity polytope.
- On the \(k\)-cut problem
- Design of Capacitated Multicommodity Networks with Multiple Facilities
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- Backbone Network Design Tools with Economic Tradeoffs
- A Heuristic Procedure for Leasing Channels in Telecommunications Networks
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Network Design Using Cut Inequalities
- Capacitated Network Design—Polyhedral Structure and Computation
