A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration
type: Item
instance of: scholarly article
title: A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration
zbMATH Open document ID: 1430.90115
author: Alfredo Moreno
author: Pedro Munari
author: Douglas Alem
published in: European Journal of Operational Research
publication date: 2019-01-18T00:00:00Z
full work available at URL: MorenoEtalEJOR2018ABranchAndBenders.pdf
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7003090
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: Benders decomposition
zbMATH Keywords: branch-and-cut
zbMATH Keywords: crew scheduling and routing
zbMATH Keywords: road restoration
describes a project that uses: NETGEN
MaRDI profile type: Publication
OpenAlex ID: W2899721843
Wikidata QID: Q113102325
cites work: Multi-vehicle prize collecting arc routing for connectivity problem
cites work: Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: A survey on Benders decomposition applied to fixed-charge network design problems
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: A note on two problems in connexion with graphs
cites work: Benchmarking optimization software with performance profiles.
cites work: A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
cites work: New optimality cuts for a single-vehicle stochastic routing problem
cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
cites work: The integer \(L\)-shaped method for stochastic integer programs with complete recourse
cites work: An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
cites work: Network repair crew scheduling and routing for emergency relief distribution problem
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: The Benders decomposition algorithm: a literature review
cites work: An improved Benders decomposition algorithm for the tree of hubs location problem
cites work: Optimal scheduling of emergency roadway repair and subsequent relief distribution
DOI: 10.1016/J.EJOR.2018.11.004
description: scientific article; zbMATH DE number 7003090