Logic-Based Decomposition Methods for the Travelling Purchaser Problem

DOI10.1007/978-3-319-33954-2_5zbMath1475.90012OpenAlexW2474275927MaRDI QIDQ2815095

Tony T. Tran, Kyle E. C. Booth, 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

Mathematics Subject Classification ID

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

Related Items (4)

Type-2 integrated process-planning and scheduling problem: reformulation and solution algorithms ⋮ Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling ⋮ Logic-Based Benders Decomposition for Large-Scale Optimization ⋮ Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut

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