Path-reduced costs for eliminating arcs in routing and scheduling
DOI10.1287/IJOC.1090.0341zbMATH Open1243.90064OpenAlexW2144303296MaRDI QIDQ2899063FDOQ2899063
Authors: Stefan Irnich, Guy Desaulniers, Jacques Desrosiers, 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
Recommendations
- The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- Pricing routines for vehicle routing with time windows on road networks
- Dynamic programming algorithms for the elementary shortest path problem with resource constraints
- Shortest Path Problems with Resource Constraints
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)
Cited In (29)
- Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty
- 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
- A POPMUSIC matheuristic for the capacitated vehicle routing problem
- Exact makespan minimization of unrelated parallel machines
- Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier
- Perspectives on integer programming for time-dependent models
- Reducing Path TSP to TSP
- Selective arc‐ng pricing for vehicle routing
- A generic exact solver for vehicle routing and related problems
- New enhancements for the exact solution of the vehicle routing problem with time windows
- Avoiding redundant columns by adding classical Benders cuts to column generation subproblems
- Improved branch-cut-and-price for capacitated vehicle routing
- Column elimination for capacitated vehicle routing problems
- A branch-and-price algorithm for the minimum latency problem
- Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
- 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
- New exact techniques applied to a class of network flow formulations
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- The conditional \(p\)-dispersion problem
- Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems
- Estimating the marginal cost to deliver to individual customers
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- Exact solution of network flow models with strong relaxations
- Finding cheapest deadline paths
- Branch-and-price based heuristic algorithm for fuzzy multi-depot bus scheduling problem
- Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model
This page was built for publication: Path-reduced costs for eliminating arcs in routing and scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2899063)
