Stronger K-tree relaxations for the vehicle routing problem

Article Abstract:

Vehicle Routing Problem (VRP) applies to large class of problems involving the distribution of goods, services, information or personnel. A relax and cut method that is parallel to Lagrangian Clarke and Wright Algorithm (LCWA) is proposed, which reduces the total distance time of vehicles in delivering customer orders.

Europe

---

A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem

Article Abstract:

Network flow models to reduce job scheduling problems on similar machines in an aircraft maintenance company are presented.

Management dynamics, Aircraft, Brazil, Methods, Analysis, Management, Scheduling (Management), Aircraft industry, Polynomials, Company business management, Sequential machine theory

---

A factor 1/2 approximation algorithm for two-stage stochastic matching problems

Article Abstract:

A method for solving stochastic maximum-weight matching problem, by using factor 1/2 approximation algorithm, is presented.

Mathematical optimization, Optimization theory, Approximation theory, Approximation

Similar abstracts:

• Abstracts: Iterative restart technique for solving timetabling problems. Memetic algorithm timetabling for non-commercial sport leagues
• Abstracts: A linear approximation model for the parameter design problem. Heuristic methods for gang-rip saw arbor designs
• Abstracts: A probabilistic interpretation of the final rankings in AHP. Preference and veto thresholds in multicriteria analysis based on stochastic dominance
• Abstracts: A method for finding the set of non-dominated vectors for multiple objective integer linear programs
• Abstracts: A method for finding the set of non-dominated vectors for multiple objective integer linear programs. part 2 Average shadow price in a mixed integer linear programming problem

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.