Branch-price-and-cut for the mixed capacitated general routing problem with time windows
type: Item
instance of: scholarly article
title: Branch-price-and-cut for the mixed capacitated general routing problem with time windows
zbMATH Open document ID: 1403.90094
author: Claudio Ciancio
author: Demetrio Laganà
author: Francesca Vocaturo
published in: European Journal of Operational Research
publication date: 2018-05-30T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6876637
zbMATH Keywords: general routing problem
zbMATH Keywords: graph transformation
zbMATH Keywords: integer programming
zbMATH Keywords: column generation
describes a project that uses: CBMix
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.11.039
OpenAlex ID: W2768187667
cites work: The undirected capacitated general routing problem with profits
cites work: A lower bound for the node, edge, and arc routing problem
cites work: Exact methods based on node-routing formulations for undirected arc-routing problems
cites work: New route relaxation and pricing strategies for the vehicle routing problem
cites work: Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
cites work: Exact algorithms for routing problems under vehicle capacity constraints
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: Improved lower bounds and exact algorithm for the capacitated arc routing problem
cites work: A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
cites work: A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem
cites work: Exact solution of the generalized routing problem through graph transformations
cites work: Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
cites work: Modeling and solving the mixed capacitated general routing problem
cites work: Q4673408
cites work: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
cites work: A branch-price-and-cut algorithm for multi-mode resource leveling
cites work: Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
cites work: Q4532228
cites work: Q4692508
cites work: Two-phase branch-and-cut for the mixed capacitated general routing problem
cites work: Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
cites work: Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
cites work: Formulations and exact algorithms for the vehicle routing problem with time windows
cites work: Modeling and solving several classes of arc routing problems as traveling salesman problems
cites work: Q4532227
cites work: Efficient elementary and restricted non-elementary route pricing
cites work: Stabilized column generation
cites work: Improved branch-cut-and-price for capacitated vehicle routing
cites work: Recent advances in memetic algorithms.
cites work: New dynamic programming algorithms for the resource constrained elementary shortest path problem
cites work: Interior point stabilization for column generation
cites work: Arc routing problems with time-dependent service costs
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
cites work: A Decade of Capacitated Arc Routing
DOI: 10.1016/J.EJOR.2017.11.039
Recommended article: A branch-and-price algorithm for capacitated arc routing problem with flexible time windows
Recommended article: Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows
Recommended article: Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
Recommended article: Two-phase branch-and-cut for the mixed capacitated general routing problem
Recommended article: A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen
Recommended article: A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
Recommended article: The robust vehicle routing problem with time windows: solution by branch and price and cut
Recommended article: Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows
Recommended article: A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
description: scientific article; zbMATH DE number 6876637