A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)

Cited In (65)

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
A parallel branch-and-bound heuristic for the integrated long-haul and local vehicle routing problem on an adaptive transportation network
Applications of meta-heuristics to traffic engineering in IP networks
Intra-domain traffic engineering with shortest path routing protocols
Matheuristics: survey and synthesis
A three-phase heuristic algorithm for fixed-charge capacitated material flow network design with input/output points location
Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks
Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths
Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design
Benders Decomposition for Capacitated Network Design
Revisiting Lagrangian relaxation for network design
The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation
MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem
Mathematical programming based heuristics for the 0--1 MIP: a survey
The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
Memetic algorithms
On the minimum cost multiple-source unsplittable flow problem
Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities
Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times
A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem
Multiobjective design of survivable IP networks
A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design
Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
Title not available (Why is that?)
Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
Matheuristics for the single-path design-balanced service network design problem
A cutting plane algorithm for the capacitated connected facility location problem
Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
Title not available (Why is that?)
A branch-and-cut algorithm for capacitated network design problems
On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
Scatter search for network design problem
Sustainability SI: multimode multicommodity network design model for intermodal freight transportation with transfer and emission costs
A continuous bi-level model for the expansion of highway networks
Benders, metric and cutset inequalities for multicommodity capacitated network design
Selecting hierarchical facilities in a service-operations environment
Service network design in freight transportation
The transit time constrained fixed charge multi-commodity network design problem
A capacity scaling heuristic for the multicommodity capacitated network design problem
Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound
Alternating control tree search for knapsack/covering problems
A local branching heuristic for the capacitated fixed-charge network design problem
Algorithms for the non-bifurcated network design problem
Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
Coordination between strategic forest management and tactical logistic and production planning in the forestry supply chain
0-1 reformulations of the multicommodity capacitated network design problem
Stabilizing branch‐and‐price for constrained tree problems
On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem
Optimization of OSPF Routing in IP Networks
Effective material flow at an assembly facility
Solving a capacitated hub location problem
Metric inequalities and the network loading problem
A first multilevel cooperative algorithm for capacitated multicommodity network design
Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
Parallel subgradient algorithm with block dual decomposition for large-scale optimization
Separating tight metric inequalities by bilevel programming
A Lagrangian relaxation approach for expansion of a highway network
Intra-domain traffic engineering with shortest path routing protocols
Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints
Anycasting in connection-oriented computer networks: Models, algorithms and results
A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
An integer programming column generation principle for heuristic search methods

   Recommendations

Title not available (Why is that?) 👍 👎
Title not available (Why is that?) 👍 👎
Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound 👍 👎
A Lagrangean heuristic for the capacitated concave minimum cost network flow problem 👍 👎
Algorithms – ESA 2005 👍 👎

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)