Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
From MaRDI portal
Recommendations
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
- A cutting-plane neighborhood structure for fixed-charge capacitated multicommodity network design problem
- MIP neighborhood search heuristics for a capacitated fixed-charge network design problem
- Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs
Cited in
(47)- 0-1 reformulations of the multicommodity capacitated network design problem
- A local branching heuristic for the capacitated fixed-charge 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
- Optimisation of transportation service network using \(\kappa\)-node large neighbourhood search
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
- 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
- Modeling interdependencies in infrastructure systems using multi-layered network flows
- A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design
- Optimization models for forest road upgrade planning
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- A cutting plane algorithm for the capacitated connected facility location problem
- Service network design models for two-tier city logistics
- A first multilevel cooperative algorithm for capacitated multicommodity network design
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- The single-node dynamic service scheduling and dispatching problem
- The index selection problem with configurations and memory limitation: a scatter search approach
- The transit time constrained fixed charge multi-commodity network design problem
- Scheduled service network design for freight rail transportation
- A cutting-plane neighborhood structure for fixed-charge capacitated multicommodity network design problem
- Multimodal freight transportation planning: a literature review
- Linear programming and Lagrangian relaxation heuristics for designing a material flow network on a block layout
- Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints
- Progressive hedging-based metaheuristics for stochastic network design
- A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
- Mixed integer non-linear programming models for green network design
- A scatter search heuristic for the fixed-charge capacitated network design problem
- A three-phase heuristic algorithm for fixed-charge capacitated material flow network design with input/output points location
- A novel modeling approach for express package carrier planning
- A learning-based matheuristic for stochastic multicommodity network design
- Data-driven robust resource allocation with monotonic cost functions
- MIP neighborhood search heuristics for a capacitated fixed-charge network design problem
- Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods
- Minimum‐cost flow problems having arc‐activation costs
- Metaheuristics: A Canadian Perspective
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- A hybrid algorithm for large-scale service network design considering a heterogeneous fleet
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- A metaheuristic for stochastic service network design
- Adaptive large neighborhood search algorithm for redesigning a closed-loop supply chain network considering capacity configurations
- Strengthening dual bounds for multicommodity capacitated network design with unsplittable flow constraints
- Scale-free networks with positive integer exponent
- A capacity scaling heuristic for the multicommodity capacitated network design problem
This page was built for publication: Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637378)
