A computational comparison of flow formulations for the capacitated location-routing problem
type: Item
instance of: scholarly article
title: A computational comparison of flow formulations for the capacitated location-routing problem
zbMATH Open document ID: 1474.90373
author: Claudio Contardo
author: Jean-François Cordeau
author: Bernard Gendron
published in: Discrete Optimization
publication date: 2018-10-18T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6958401
zbMATH Keywords: location-routing
zbMATH Keywords: flow formulations
zbMATH Keywords: branch-and-cut
describes a project that uses: Knapsack
describes a project that uses: Concorde
describes a project that uses: CVRPSP
MaRDI profile type: Publication
full work available at URL: j.disopt.2013.07.005
OpenAlex ID: W1970402125
cites work: A Branch-and-Cut method for the Capacitated Location-Routing Problem
cites work: An exact method for the capacitated location-routing problem
cites work: A heuristic solution to the warehouse location-routing problem
cites work: Heuristic solutions to multi-depot location-routing problems
cites work: A two-phase tabu search approach to the location routing problem
cites work: Symmetry in Integer Linear Programming
cites work: An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
cites work: Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
cites work: A result on projection for the vehicle routing problem
cites work: A new branch-and-cut algorithm for the capacitated vehicle routing problem
cites work: Edmonds polytopes and weakly hamiltonian graphs
cites work: On the symmetric travelling salesman problem I: Inequalities
cites work: Q5184698
cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
cites work: Easy and difficult objective functions for max cut
cites work: Multi-Terminal Network Flows
cites work: Robust branch-and-cut-and-price for the capacitated vehicle routing problem
cites work: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
cites work: An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
cites work: Improved lower bounds and exact algorithm for the capacitated arc routing problem
DOI: 10.1016/J.DISOPT.2013.07.005
Recommended article: An exact method for the capacitated location-routing problem
Recommended article: A new formulation approach for location-routing problems
Recommended article: A Branch-and-Cut method for the Capacitated Location-Routing Problem
Recommended article: The capacitated multiple allocation hub location problem: Formulations and algorithms
Recommended article: Comparison of formulations for the inventory routing problem
Recommended article: Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
Recommended article: A computational evaluation of a general branch-and-price framework for capacitated network location problems
Recommended article: An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
description: scientific article; zbMATH DE number 6958401