A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem

DOI10.1007/978-3-642-21527-8_49MaRDI QIDQ3091526zbMATH OpenOpenAlexFDO

Authors Nora Touati Moungla, Pietro Belotti, Vincent Jost, Leo Liberti

Publication date 9 September 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21527-8_49

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)

Recommendations

• A branch-and-price algorithm for a routing problem with inbound and outbound requests
• A branch-and-price algorithm for a vehicle routing with demand allocation problem
• A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
• Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
• Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem
• A profit-maximization location-routing-pricing problem: a branch-and-price algorithm
• A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands

Cited in

(3)

• Branch-and-price algorithm for a multicast routing problem
• A profit-maximization location-routing-pricing problem: a branch-and-price algorithm
• Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price

This page was built for publication: A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3091526)