Modelling, Computation and Optimization in Information Systems and Management Sciences
Proceedings of the 4th International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences - MCO 2021
Published on 7. December 2021
XII, 404 pages
978-3-030-92666-3 (ISBN)
Description
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.
More details
Series
Edition
1st ed. 2022
Language
English
Place of publication
Cham
Switzerland
Publishing group
Springer International Publishing
Target group
Professional and scholarly
Product notice
Reflowable
Illustrations
XII, 404 p. 157 illus., 92 illus. in color.
File size
29,24 MB
ISBN-13
978-3-030-92666-3 (9783030926663)
DOI
10.1007/978-3-030-92666-3
Schweitzer Classification
Other editions
Additional editions
Hoai An Le Thi | Tao Pham Dinh | Hoai Minh Le
Modelling, Computation and Optimization in Information Systems and Management Sciences
Proceedings of the 4th International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences - MCO 2021
Book
12/2021
Springer
€246.09
Shipment within 7-9 days
Content
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.
