Pages that link to "Item:Q4731020"
From MaRDI portal
The following pages link to A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design (Q4731020):
Displayed 32 items.
- An homage to Joseph-Louis Lagrange and Pierre Huard (Q537596) (← links)
- Lagrangean bounds for the optimum communication spanning tree problem (Q611003) (← links)
- Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← links)
- A multicast problem with shared risk cost (Q691394) (← links)
- Models for planning capacity expansion in local access telecommunication networks (Q806810) (← links)
- Scatter search for network design problem (Q817138) (← links)
- About Lagrangian methods in integer optimization (Q817183) (← links)
- The generalized fixed-charge network design problem (Q856677) (← links)
- Solving multiple scenarios in a combinatorial auction (Q1017447) (← links)
- An effective linear approximation method for separable programming problems (Q1036545) (← links)
- Finding minimum cost directed trees with demands and capacities (Q1179742) (← links)
- Primary and secondary route selection in backbone communication networks (Q1268202) (← links)
- Multicommodity flow models for spanning trees with hop constraints (Q1278374) (← links)
- A dual ascent approach to the fixed-charge capacitated network design problem (Q1278408) (← links)
- Planning models for freight transportation (Q1278638) (← links)
- Design of a distributed finer transport network with hubbing topology (Q1291680) (← links)
- A technique for speeding up the solution of the Lagrangean dual (Q1315429) (← links)
- Routing and capacity assignment in backbone communication networks (Q1373886) (← links)
- Some thoughts on combinatorial optimisation (Q1388818) (← links)
- Service network design in freight transportation (Q1582187) (← links)
- A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem'' (Q1600948) (← links)
- A monotonic, dual-based bounding procedure for integer programs (Q1894724) (← links)
- General network design: a unified view of combined location and network design problems (Q1926688) (← links)
- Computational risk management techniques for fixed charge network flow problems with uncertain arc failures (Q1945698) (← links)
- A tabu search procedure for multicommodity location/allocation with balancing requirements (Q2367013) (← links)
- Topological design of a two-level network with ring-star configuration (Q2367422) (← links)
- Memetic algorithms (Q2573010) (← links)
- Reload cost trees and network design (Q2913949) (← links)
- Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints (Q3057143) (← links)
- Analysis and computational study of several integer programming formulations for minimum-energy multicasting in wireless ad hoc networks (Q3528150) (← links)
- Capacitated facility location/network design problems. (Q5928375) (← links)
- Dual-based approach for a hub network design problem under non-restrictive policy (Q5938396) (← links)