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.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2004
User Contributions:
Comment about this article or add new information about this topic:
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.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2005
User Contributions:
Comment about this article or add new information about this topic:
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.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
User Contributions:
Comment about this article or add new information about this topic:
- 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