Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{153340,
        author = {Akash Pandey  and Subhash Kumar Sharma and Umesh Kumar Gupta},
        title = {An approach to operations research techniques and constraint programming },
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {8},
        number = {6},
        pages = {525-535},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=153340},
        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.},
        keywords = {Constraint Programming, Operations Research, Operation Research Techniques. },
        month = {},
        }