Logic-Based Decomposition Methods for the Travelling Purchaser Problem

DOI10.1007/978-3-319-33954-2_5zbMATH Open1475.90012OpenAlexW2474275927MaRDI QIDQ2815095FDOQ2815095

Authors: Kyle E. C. Booth, Tony T. Tran, J. Christopher Beck 

Publication date: 27 June 2016

Published in: Integration of AI and OR Techniques in Constraint Programming (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1807/72415

Recommendations

• A branch and bound algorithm for the traveling purchaser problem
• A heuristic approach for the travelling purchaser problem
• Parameterized algorithms and complexity for the traveling purchaser problem and its variants
• Logic-based benders decomposition for an inter-modal transportation problem
• The traveling purchaser problem and its variants
• Heuristics for the traveling purchaser problem
• A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
• Metaheuristics based on decision hierarchies for the traveling purchaser problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Cited In (4)

• Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling
• Type-2 integrated process-planning and scheduling problem: reformulation and solution algorithms
• Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut
• Logic-based Benders decomposition for large-scale optimization

This page was built for publication: Logic-Based Decomposition Methods for the Travelling Purchaser Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815095)