Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff

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) Combinatorial optimization (90C27)

Cites Work

Unnamed Item
Unnamed Item
The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem
A comparison of column-generation approaches to the synchronized pickup and delivery problem
Improved bounds for large scale capacitated arc routing problem
A column generation algorithm for the vehicle routing problem with soft time windows
The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
On the capacitated vehicle routing problem
The traveling salesman problem and its variations
A branch-and-price algorithm for the minimum latency problem
Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
Fleet assignment and routing with schedule synchronization constraints
The pickup and delivery problem with time windows, multiple stacks, and handling operations
Improved branch-cut-and-price for capacitated vehicle routing
Resource extension functions: properties, inversion, and generalization to segments
Branch-and-price: Column generation for solving huge integer programs
2-path cuts for the vehicle routing problem with time windows
The shortest path problem with time windows and linear waiting costs
New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
Vehicle Routing
Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
Column Generation
Selected Topics in Column Generation
Shortest Path Problems with Resource Constraints
Benchmarking optimization software with performance profiles.
Selective arc‐ng pricing for vehicle routing
Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows
Partial Dominance in Branch-Price-and-Cut for the Basic Multicompartment Vehicle-Routing Problem

This page was built for publication: Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff