The distance constrained multiple vehicle traveling purchaser problem
From MaRDI portal
(Redirected from Publication:2256245)
Recommendations
- A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand
- The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
- A stochastic programming approach for the traveling purchaser problem
- The traveling purchaser problem with budget constraint
- Models for a traveling purchaser problem with additional side-constraints
Cites work
- 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 new approach to the maximum-flow problem
- An acquisition policy for a single item multi-supplier system
- An exact algorithm for the capacitated total quantity discount problem
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Branch-and-price: Column generation for solving huge integer programs
- Column Generation
- Column generation based primal heuristics
- Exact algorithms for procurement problems under a total quantity discount structure
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Exploring greedy criteria for the dynamic traveling purchaser problem
- Integer Programming Formulation of Traveling Salesman Problems
- Models for a traveling purchaser problem with additional side-constraints
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- Optimal solutions for routing problems with profits
- Quantity discount decisions under conditions of multiple items, multiple suppliers and resource limitations
- Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
- Solving the asymmetric traveling purchaser problem
- The concave cost supply problem.
- The distance constrained multiple vehicle traveling purchaser problem
- The shortest-path problem with resource constraints and k-cycle elimination for k 3
- The traveling purchaser problem with budget constraint
Cited in
(14)- A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand
- The traveling purchaser problem with time-dependent quantities
- A stochastic programming model for a tactical solid waste management problem
- The undirected capacitated general routing problem with profits
- The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
- Prioritized single nurse routing and scheduling for home healthcare services
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- The traveling purchaser problem with fast service option
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance 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 distance constrained multiple vehicle traveling purchaser problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256245)
