Central Asia Business Journal

Corporate Digital Responsibility: New Horizon and Benefits for Businesses 1

Issue 22(1) Authors

The paper attempts to define the concept of Corporate Digital Responsibility (CDR) and different benefits of CDR for businesses. At the same time, the issue of Corporate Social Responsibility (CSR) is also discussed as they are connected with each other and both are beneficial to the society in general. The topic of CDR is promising and it provides different benefits for the society as well as for businesses. Digitization concerns the virtual world today. it is important to merge sustainability with the virtual world, bringing these two concepts together is crucial. This merging is called Corporate Digital Responsibility (CDR). The importance of digitalization is discussed as well as benefits of digitalization are presented. An obvious benefit of digitization of CSR is the scaling back on the use of paper. Cloud storage eliminates paper waste and makes it easier to access all documents from anywhere. Digitalization reduces the emissions produced for every ton of paper. Paper does not only create energy waste; it also creates water waste. The paper production endangers natural habitats: over thirty million acres of woods are being destroyed yearly. Therefore, a digital platform or an application can significantly lower the organization’s environmental impact.…

An Experimental Supported by Some Strong Theoretical Arguments Proof of the Fundamental Equality P=NP

Issue Authors

A refined version of the algorithm for constructing all 0-1 integer solutions for linear Diophantine equations is introduced. The correctness and its polynomial time complexity is confirmed by a Monte Carlo experiment that uses the trivial simple combinatorics. An implementation of this algorithm proves the polynomial time solvability of many business decision and optimization problems that are currently considered as being intractable: bin packing and cutting stock, open-shop and job-shop scheduling, production planning, dynamic storage allocation and many others. It is shown that all these problems admit polynomial time algorithms for their solution. An experimental proof of the important for the theory fact that every planar symmetric graph possesses at least one Hamiltonian circuit is given. A much faster exact polynomial time algorithm for solving symmetric traveling salesman problems is suggested. The algorithm shows that such problems may have several optimal solutions. Numeric randomly generated instances with such solutions that can be used as test examples for newly developed algorithms are presented. Results of this research present a reliable experimental proof of the fundamental equality P=NP. AMS subject classifications (2010): 05A18, 05C45, 90C10, 90C27, 11D04, 68Q15,…

Volume 123

Issue 1(1&2) Authors

Volume 2

Issue 2(1&2) Authors

Volume 3

Issue 3(1&2) Authors

Volume 4

Issue 4(1&2) Authors

Volume 5

Issue 5(1&2) Authors

Volume 6

Issue 6(1&2) Authors

Volume 10

Issue 10(1&2) Authors

Volume 11

Issue 11(1&2) Authors

Volume 14

Issue 14(1&2) Authors

Volume 15

Issue 15(1&2) Authors

Volume 17

Issue 17(1&2) Authors

Volume 18

Issue 18(1&2) Authors

Volume 19

Issue 19(1&2) Authors

Volume 20(1)

Issue 20(1) Authors

Volume 20(2)

Issue 20(2) Authors

Volume 20(3)

Issue 20(3) Authors

Volume 21(1)

Issue 21(1) Authors

Volume 21(2)

Issue 21(2) Authors

Volume 21(3)

Issue 21(3) Authors

Volume 22(1)

Issue 22(1) Authors

Volume 22(2)

Issue 22(2) Authors

Volume 23(1)

Issue 14(1) Authors

Volume 23(1)2

Issue 14(1) Authors