A Simplex-Based Tabu Search Method for Capacitated Network Design
From MaRDI portal
Cited in
(43)- 0-1 reformulations of the multicommodity capacitated network design problem
- A local branching heuristic for the capacitated fixed-charge network design problem
- Hybridizing exact methods and metaheuristics: a taxonomy
- Service network design in freight transportation
- 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
- A review of transport market modeling using game-theoretic principles
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
- Near real-time loadplan adjustments for less-than-truckload carriers
- Algorithms for an integer multicommodity network flow problem with node reliability considerations
- Algorithms for the non-bifurcated network design problem
- A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design
- A cutting plane algorithm for the capacitated connected facility location problem
- 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
- The single-node dynamic service scheduling and dispatching problem
- Memetic algorithms
- The transit time constrained fixed charge multi-commodity 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
- Effective material flow at an assembly facility
- A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
- A three-phase heuristic algorithm for fixed-charge capacitated material flow network design with input/output points location
- Single source single-commodity stochastic network design
- A Lagrangian relaxation approach for expansion of a highway network
- Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité
- A scheme for determining vehicle routes based on Arc-based service network design
- Integrating operations research in constraint programming
- Integrating operations research in constraint programming
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods
- Avoiding unnecessary demerging and remerging of multi‐commodity integer flows
- Metaheuristics: A Canadian Perspective
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- Strengthening dual bounds for multicommodity capacitated network design with unsplittable flow constraints
- Scatter search for network design problem
- Metaheuristics in combinatorial optimization
- A capacity scaling heuristic for the multicommodity capacitated network design problem
- An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems
This page was built for publication: A Simplex-Based Tabu Search Method for Capacitated Network Design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427333)
