Path-reduced costs for eliminating arcs in routing and scheduling
From MaRDI portal
Publication:2899063
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
Cited in
(29)- Perspectives on integer programming for time-dependent models
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
- Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model
- A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection
- 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
- Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems
- A branch-and-price algorithm for the minimum latency problem
- New enhancements for the exact solution of the vehicle routing problem with time windows
- Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
- Estimating the marginal cost to deliver to individual customers
- Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty
- Branch-and-price based heuristic algorithm for fuzzy multi-depot bus scheduling problem
- New exact techniques applied to a class of network flow formulations
- Reducing Path TSP to TSP
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier
- Robust vehicle routing under uncertainty via branch-price-and-cut
- Avoiding redundant columns by adding classical Benders cuts to column generation subproblems
- 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
- Improved branch-cut-and-price for capacitated vehicle routing
- Selective arc‐ng pricing for vehicle routing
- Exact makespan minimization of unrelated parallel machines
- A generic exact solver for vehicle routing and related problems
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- Finding cheapest deadline paths
- The conditional \(p\)-dispersion problem
- Column elimination for capacitated vehicle routing problems
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)
