Survivable capacitated network design problem: new formulation and Lagrangean relaxation
From MaRDI portal
Publication:3156578
DOI10.1057/palgrave.jors.2600913zbMath1055.90539OpenAlexW2056730053MaRDI QIDQ3156578
No author found.
Publication date: 10 January 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600913
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items (5)
Design of survivable wireless backhaul networks with reliability considerations ⋮ Survivable network design under optimal and heuristic interdiction scenarios ⋮ Reliable intermodal freight network expansion with demand uncertainties and network disruptions ⋮ Lagrangean relaxation heuristics for the \(p\)-cable-trench problem ⋮ Reliable routing of road-rail intermodal freight under uncertainty
This page was built for publication: Survivable capacitated network design problem: new formulation and Lagrangean relaxation
