Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling
From MaRDI portal
Publication:2899063
DOI10.1287/ijoc.1090.0341zbMath1243.90064OpenAlexW2144303296MaRDI QIDQ2899063
Jacques Desrosiers, Stefan Irnich, Guy Desaulniers, Ahmed Hadjar
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1090.0341
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)
Related Items (25)
A branch-and-price algorithm for the minimum latency problem ⋮ Improved branch-cut-and-price for capacitated vehicle routing ⋮ Exact makespan minimization of unrelated parallel machines ⋮ Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem ⋮ A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection ⋮ A POPMUSIC matheuristic for the capacitated vehicle routing problem ⋮ Column elimination for capacitated vehicle routing problems ⋮ Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems ⋮ Estimating the marginal cost to deliver to individual customers ⋮ Selective arc‐ng pricing for vehicle routing ⋮ Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier ⋮ A generic exact solver for vehicle routing and related problems ⋮ New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows ⋮ Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model ⋮ Exact solution of network flow models with strong relaxations ⋮ Arc flow formulations based on dynamic programming: theoretical foundations and applications ⋮ Perspectives on integer programming for time-dependent models ⋮ Avoiding redundant columns by adding classical Benders cuts to column generation subproblems ⋮ The conditional \(p\)-dispersion problem ⋮ Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem ⋮ New exact techniques applied to a class of network flow formulations ⋮ Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty ⋮ A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints ⋮ Robust vehicle routing under uncertainty via branch-price-and-cut ⋮ New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources
This page was built for publication: Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling
