An approach to operations research techniques and constraint programming

An approach to operations research techniques and constraint programming
Author(s):
Akash Pandey , Subhash Kumar Sharma, Umesh Kumar Gupta
Keywords:
Constraint Programming, Operations Research, Operation Research Techniques.
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.
Article Details
Unique Paper ID: 153340 Publication Volume & Issue: Volume 8, Issue 6 Page(s): 525 - 535
Article Preview & Download

Share This Article

NCSST-2021

AICTE Sponsored National Conference on Smart Systems and Technologies

Last Date: 25th November 2021

LATEST INNOVATION’S AND FUTURE TRENDS IN MANAGEMENT

Last Date: 7th November 2021