Modeling and solving profitable location and distribution problems

DOI10.1007/S11590-012-0550-0zbMath1280.90009OpenAlexW2035046030MaRDI QIDQ375987

Alberto Ceselli, Emanuele Tresoldi, Giovanni Righini

Publication date: 1 November 2013

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-012-0550-0

zbMATH Keywords

column generationlocationroutinglocation-routingunified approachbranch-and-price-and-cut

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Related Items (1)

Combined location and routing problems for drug distribution

Uses Software

• SYMPHONY
• CVRPSP

Cites Work

• Location-routing: issues, models and methods
• Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
• 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
• The effect of ignoring routes when locating depots
• Distribution network design: New problems and related models
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Combined location and routing problems for drug distribution
• Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
• 2-Path Cuts for the Vehicle Routing Problem with Time Windows
• A two-stage vehicle routing model for large-scale bioterrorism emergencies
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• Column Generation

This page was built for publication: Modeling and solving profitable location and distribution problems