Modelling, Computation and Optimization in Information Systems and Management Sciences (eBook, PDF)

Proceedings of the 4th International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences - MCO 2021

• Format: PDF

Produktbeschreibung

The proceedings consist of 34 papers which have been submitted to the 4th international conference on Modelling, Computation & Optimization in Information Systems and Management Science (MCO 2021) held on 11-13 December, 2021 at Hanoi, Vietnam. The book is composed of 3 parts: Optimization of complex systems - models and methods, Machine Learning - algorithms and applications, and Cryptography. All chapters in the books discuss theoretical and algorithmic as well as practical issues connected with modelling, computation & optimization in Information Systems and Management Science. Researchers and practitioners in related areas will find a wealth of inspiring ideas and useful tools & techniques for their own work.

Produktdetails

• Verlag: Springer International Publishing
• Erscheinungstermin: 7. Dezember 2021
• Englisch
• ISBN-13: 9783030926663
• Artikelnr.: 63102789

Inhaltsangabe

Chapter 1: Modelling, Computation and Optimization in Information Systems and Management Sciences.- Chapter 2: An Interior Proximal Method with Proximal Distances for Quasimonotone Equilibrium Problems.- Chapter 3: Beyond Pointwise Submodularity: Non-Monotone Adaptive Submodular Maximization subject to Knapsack and k-System Constraints.- Chapter 4: Optimizing a Binary Integer Program by Identifying its Optimal Core Problem- a New Optimization Concept Applied to the Multidimensional Knapsack Problem.- Chapter 5: A Comparison Between Optimization Tools to Solve Sectorization Problem.

---

Chapter 1: Modelling, Computation and Optimization in Information Systems and Management Sciences.- Chapter 2: An Interior Proximal Method with Proximal Distances for Quasimonotone Equilibrium Problems.- Chapter 3: Beyond Pointwise Submodularity: Non-Monotone Adaptive Submodular Maximization subject to Knapsack and k-System Constraints.- Chapter 4: Optimizing a Binary Integer Program by Identifying its Optimal Core Problem- a New Optimization Concept Applied to the Multidimensional Knapsack Problem.- Chapter 5: A Comparison Between Optimization Tools to Solve Sectorization Problem.