Modeling and solving profitable location and distribution problems
From MaRDI portal
(Redirected from Publication:375987)
Recommendations
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- A profit-maximization location-routing-pricing problem: a branch-and-price algorithm
- A survey of recent research on location-routing problems
- An exact method for the capacitated location-routing problem
- scientific article; zbMATH DE number 4051316
Cites work
- 2-path cuts for the vehicle routing problem with time windows
- A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows
- A computational evaluation of a general branch-and-price framework for capacitated network location problems
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- A two-stage vehicle routing model for large-scale bioterrorism emergencies
- Column Generation
- Combined location and routing problems for drug distribution
- Distribution network design: New problems and related models
- Location-routing: issues, models and methods
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- The effect of ignoring routes when locating depots
Cited in
(4)
This page was built for publication: Modeling and solving profitable location and distribution problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q375987)