A Study on Importance of Constraint Programming and Operations Research
DOI:
https://doi.org/10.29070/k4et7x96Keywords:
constraint programming, operations research, combinatorial enhancement issues, primal-double arrangement approach, coordination, solver, domain separating, component generation, logic-based Benders decay, dynamic programming modelsAbstract
We present a diagram of the coordination of imperative programming (CP) and operations research (OR) to explain combinatorial enhancement issues. We translate CP or potentially as depending on a typical primal-double arrangement approach that gives the premise to reconciliation utilizing four principle systems. The main technique firmly intertwines engendering from CP and unwinding from OR in a solitary solver. The second applies OR strategies to domain separating in CP. The third breaks down the issue into a segment explained by CP and a part fathomed by OR, utilizing CP-based segment age or rationale based Benders decay. The fourth uses loosened up choice charts created for CP engendering to help fathom dynamic programming models in OR. The paper refers to a noteworthy portion of the writing on CPOR mix and closes with future points of view.Downloads
References
Beame, P., Kautz, H., Sabharwal, A. (2003). Understanding the power of clause learning. In: International Joint Conference on Artificial Intelligence (IJCAI 2003).
Beaumont, N. (1990). An algorithm for disjunctive programs. European Journal of Operational Research 48, pp. 362–371.
Beck, J.C. (2010). Checking up on branch-and-check. In: D. Cohen (ed.) Principle and Practice of Constraint Programming (CP), Lecture Notes in Computer Science, vol. 6308, pp. 84–98.
Beldiceanu, N., Contejean, E. (1994). Introducing global constraints in CHIP. Mathematical and Computer Modelling 12, pp. 97–123.
Castro, P.M., Grossmann, I.E. (2006). An efficient MILP model for the short-term scheduling of single stage batch plants. technical report, Departamento de Modela c˜ao e Simula c˜ao de Processos, INETI, Lisbon.
Coban, E., Hooker, J.N. (2013). Single-facility scheduling by logic-based benders decomposition. Annals of Operations Research 210, pp. 245–272.
Chabrier, A. (2000). A cooperative CP and LP optimizer approach for the pairing generation problem. In: CPAIOR Proceedings. Ferrara, Italy.
Chabrier, A. (2003). Heuristic branch-and-price-and-cut to solve a network design problem. In: M. Gendreau, G. Pesant, L.M. Rousseau (eds.) CPAIOR Proceedings. Montreal.
This work is licensed under a 