The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
From MaRDI portal
(Redirected from Publication:320623)
Recommendations
- A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand
- The distance constrained multiple vehicle traveling purchaser problem
- The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach
- Pickup and delivery problem with incompatibility constraints
- Solving the asymmetric traveling purchaser problem
Cites work
- scientific article; zbMATH DE number 3643036 (Why is no real title available?)
- A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
- A column generation approach for a school bus routing problem with resource constraints
- A column generation approach for the split delivery vehicle routing problem
- A stochastic programming approach for the traveling purchaser problem
- Accelerating strategies in column generation methods for vehicle routing and crew scheduling problems
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows
- Branch-and-price: Column generation for solving huge integer programs
- Decomposition Principle for Linear Programs
- Dynamic tabu search strategies for the traveling purchaser problem
- Exploring greedy criteria for the dynamic traveling purchaser problem
- Heuristics and lower bounds for the bin packing problem with conflicts
- Interior point stabilization for column generation
- Routing problems with loading constraints
- Shortest Path Problems with Resource Constraints
- Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
- Solving the Orienteering Problem through Branch-and-Cut
- Stabilized column generation
- The distance constrained multiple vehicle traveling purchaser problem
- The transportation problem with exclusionary side constraints
- The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
- The traveling purchaser problem with budget constraint
Cited in
(28)- Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order
- A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand
- Solving the set covering problem with conflicts on sets: a new parallel GRASP
- Hybridizing carousel greedy and kernel search: a new approach for the maximum flow problem with conflict constraints
- Vehicle routing problems with multiple commodities: a survey
- Pickup and delivery problem with incompatibility constraints
- Mathematical models for a ship routing problem with a small number of ports on a route
- New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty
- An exact algorithm for parallel machine scheduling with conflicts
- The directed profitable rural postman problem with incompatibility constraints
- Optimization of logistics services in hospitals
- Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand
- Scheduling identical jobs on uniform machines with a conflict graph
- Minimum cost flow problem with conflicts
- The family traveling salesman problem with incompatibility constraints
- Two-index formulations for the traveling purchaser problem with incompatibility constraints
- The undirected capacitated general routing problem with profits
- Scheduling on uniform machines with a conflict graph: complexity and resolution
- The traveling purchaser problem with fast service option
- Branch-and-price approaches for the multiperiod technician routing and scheduling problem
- Solving the team orienteering problem with cutting planes
- Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint
- Formulations for the orienteering problem with additional constraints
- The traveling purchaser problem and its variants
- Utilizing multi-vehicle traveling purchaser problem for multiple-supplier selection and multi-period lot-sizing in a fuzzy demand environment
- The bi-objective traveling purchaser problem with deliveries
- Parameterized algorithms and complexity for the traveling purchaser problem and its variants
- The distance constrained multiple vehicle traveling purchaser problem
This page was built for publication: The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q320623)
