A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
From MaRDI portal
Publication:4530653
Recommendations
Cited in
(70)- 0-1 reformulations of the multicommodity capacitated network design problem
- A local branching heuristic for the capacitated fixed-charge network design problem
- A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
- A branch-and-bound algorithm to solve a multi-level network optimization problem
- Service network design in freight transportation
- A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- Matheuristics for the single-path design-balanced service network design problem
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
- A branch-and-cut algorithm for capacitated network design problems
- Selecting hierarchical facilities in a service-operations environment
- Separating tight metric inequalities by bilevel programming
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
- Parallel subgradient algorithm with block dual decomposition for large-scale optimization
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- Algorithms for the non-bifurcated network design problem
- Sustainability SI: multimode multicommodity network design model for intermodal freight transportation with transfer and emission costs
- A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design
- Multiobjective design of survivable IP networks
- Solving a capacitated hub location problem
- A cutting plane algorithm for the capacitated connected facility location problem
- Mathematical programming based heuristics for the 0--1 MIP: a survey
- Revisiting Lagrangian relaxation for network design
- Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths
- Metric inequalities and the network loading problem
- A first multilevel cooperative algorithm for capacitated multicommodity network design
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design
- Memetic algorithms
- The transit time constrained fixed charge multi-commodity network design problem
- Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound
- Benders decomposition for capacitated network design
- Anycasting in connection-oriented computer networks: Models, algorithms and results
- On the minimum cost multiple-source unsplittable flow problem
- Linear programming and Lagrangian relaxation heuristics for designing a material flow network on a block layout
- Lower bounding techniques for the degree-constrained network design problem
- Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints
- Applications of meta-heuristics to traffic engineering in IP networks
- Effective material flow at an assembly facility
- A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
- A continuous bi-level model for the expansion of highway networks
- Optimization of OSPF routing in IP networks
- Period decompositions for the capacitated lot sizing problem with setup times
- A three-phase heuristic algorithm for fixed-charge capacitated material flow network design with input/output points location
- scientific article; zbMATH DE number 1187079 (Why is no real title available?)
- scientific article; zbMATH DE number 1264406 (Why is no real title available?)
- scientific article; zbMATH DE number 1947445 (Why is no real title available?)
- A Lagrangian heuristic algorithm for the time-dependent combined network design and routing problem
- Lagrangian heuristics for large-scale dynamic facility location with generalized modular capacities
- A Lagrangian relaxation approach for expansion of a highway network
- MIP neighborhood search heuristics for a capacitated fixed-charge network design problem
- Coordination between strategic forest management and tactical logistic and production planning in the forestry supply chain
- On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem
- On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics
- Stabilizing branch-and-price for constrained tree problems
- Exact solution of the centralized network design problem on directed graphs
- Intra-domain traffic engineering with shortest path routing protocols
- Intra-domain traffic engineering with shortest path routing protocols
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Matheuristics: survey and synthesis
- An integer programming column generation principle for heuristic search methods
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- A parallel branch-and-bound heuristic for the integrated long-haul and local vehicle routing problem on an adaptive transportation network
- Underground freight transportation for package delivery in urban environments
- Scatter search for network design problem
- A capacity scaling heuristic for the multicommodity capacitated network design problem
- Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks
- Alternating control tree search for knapsack/covering problems
- The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation
This page was built for publication: A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4530653)
