A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
From MaRDI portal
Recommendations
- A dual ascent approach to the fixed-charge capacitated network design problem
- A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem
- Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound
- Dual ascent for uncapacitated telecommunications network design with access, backbone, and switch costs
- Dual-ascent methods for large-scale multicommodity flow problems
Cited in
(57)- Solving multiple scenarios in a combinatorial auction
- An effective linear approximation method for separable programming problems
- Finding minimum cost directed trees with demands and capacities
- Primary and secondary route selection in backbone communication networks
- Multicommodity flow models for spanning trees with hop constraints
- A dual ascent approach to the fixed-charge capacitated network design problem
- Planning models for freight transportation
- Design of a distributed finer transport network with hubbing topology
- A technique for speeding up the solution of the Lagrangean dual
- Routing and capacity assignment in backbone communication networks
- Some thoughts on combinatorial optimisation
- Service network design in freight transportation
- A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem
- Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol
- Container shipping service selection and cargo routing with transshipment limits
- Fixed charge multicommodity network design using p-partition facets
- Multicommodity flows and Benders decomposition for restricted continuous location problems
- A combined facility location and network design problem with multi-type of capacitated links
- Dual ascent for uncapacitated telecommunications network design with access, backbone, and switch costs
- A monotonic, dual-based bounding procedure for integer programs
- General network design: a unified view of combined location and network design problems
- Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
- Algorithmic expedients for the S-labeling problem
- Stronger MIP formulations for the Steiner forest problem
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
- Primal convergence from dual subgradient methods for convex optimization
- Sustainability SI: multimode multicommodity network design model for intermodal freight transportation with transfer and emission costs
- A tabu search procedure for multicommodity location/allocation with balancing requirements
- Topological design of a two-level network with ring-star configuration
- Memetic algorithms
- Benders decomposition for network design covering problems
- The uncapacitated time-space fixed-charge network flow problem: an empirical investigation of procedures for arc capacity assignment
- Reload cost trees and network design
- Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem
- Heuristic algorithms for solving an integrated dynamic center facility location -- network design model
- Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints
- Dual-ascent and primal heuristics for production-assembly-distribution system design
- Models and algorithms for network reduction
- scientific article; zbMATH DE number 3885614 (Why is no real title available?)
- Analysis and computational study of several integer programming formulations for minimum-energy multicasting in wireless ad hoc networks
- Optimal network design with end-to-end service requirements
- Dual-ascent methods for large-scale multicommodity flow problems
- An Exact Algorithm for the Steiner Forest Problem
- A dual ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems
- An homage to Joseph-Louis Lagrange and Pierre Huard
- Capacitated facility location/network design problems.
- Dual-based approach for a hub network design problem under non-restrictive policy
- Matheuristics: survey and synthesis
- Lagrangean bounds for the optimum communication spanning tree problem
- Fix-and-optimize approach for a healthcare facility location/network design problem considering equity and accessibility: a case study
- Survivable networks, linear programming relaxations and the parsimonious property
- A multicast problem with shared risk cost
- Concurrent optimization of harvesting and road network layouts under steep terrain
- Models for planning capacity expansion in local access telecommunication networks
- Scatter search for network design problem
- About Lagrangian methods in integer optimization
- The generalized fixed-charge network design problem
This page was built for publication: A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4731020)
