Author Login IJIRT Partner Network (IPN) Login

An approach to operations research techniques and constraint programming

  • Unique Paper ID: 153340
  • Volume: 8
  • Issue: 6
  • PageNo: 525-535
  • Abstract:
  • The mathematical points of interest and the explicit techniques used to manufacture and investigate these models can be very modern and are tended to. Here we present an overview of the integration of constraint programming (CP) and operations research (OR) to solve combinatorial optimization problems. We interpret CP and OR as relying on a common primal-dual solution approach that provides the basis for integration using four main strategies. The first strategy tightly interweaves propagation from CP and relaxation from OR in a single solver. The second applies OR techniques to domain filtering in CP. The third decomposes the problem into a portion solved by CP and a portion solved by OR, using CP-based column generation or logic-based Benders decomposition. The fourth uses relaxed decision diagrams developed for CP propagation to help solve dynamic programming models in OR. The paper cites a significant fraction of the literature on CP/OR integration and concludes with future perspectives.
Download article email to a friend

Cite This Article

  • ISSN: 2349-6002
  • Volume: 8
  • Issue: 6
  • PageNo: 525-535

An approach to operations research techniques and constraint programming

Related Articles

Impact Factor
8.01 (Year 2024)
UGC Approved
Journal no 47859

Join Our IPN

IJIRT Partner Network

Submit your research paper and those of your network (friends, colleagues, or peers) through your IPN account, and receive 800 INR for each paper that gets published.

Join Now

Latest Publication

Archive

View More

Recent Conferences

NCSEM 2024

National Conference on Sustainable Engineering and Management - 2024 Last Date: 15th March 2024

Submit inquiry