Pages that link to "Item:Q2770085"
From MaRDI portal
The following pages link to Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound (Q2770085):
Displayed 22 items.
- A branch and bound algorithm for bi-level discrete network design problem (Q264253) (← links)
- The weighted uncapacitated planned maintenance problem: complexity and polyhedral properties (Q322558) (← links)
- Use of Lagrangian decomposition in supply chain planning (Q409926) (← links)
- Scatter search for network design problem (Q817138) (← links)
- Traffic engineering of tunnel-based networks with class specific diversity requirements (Q857786) (← links)
- Hybrid meta-heuristic algorithms for solving network design problem (Q881517) (← links)
- The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675) (← links)
- An effective linear approximation method for separable programming problems (Q1036545) (← links)
- Heuristics for the rural postman problem (Q1046717) (← links)
- A Lagrangean heuristic for the facility location problem with staircase costs (Q1278582) (← links)
- Service network design in freight transportation (Q1582187) (← links)
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
- A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations (Q2275582) (← links)
- Revisiting Lagrangian relaxation for network design (Q2414466) (← links)
- Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths (Q2469589) (← links)
- Network design and flow problems with cross-arc costs (Q2482771) (← links)
- Memetic algorithms (Q2573010) (← links)
- Lower bounding techniques for the degree-constrained network design problem (Q3057091) (← links)
- Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints (Q3057143) (← links)
- A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints (Q5158761) (← links)
- On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem (Q5191123) (← links)
- An exact algorithm for the service network design problem with hub capacity constraints (Q6085889) (← links)