A5027109127- Advanced Optimization Algorithms Research
- Numerical Methods and Algorithms
- Metaheuristic Optimization Algorithms Research
- Advanced Multi-Objective Optimization Algorithms
- Facility Location and Emergency Management
- Distributed and Parallel Computing Systems
- Parallel Computing and Optimization Techniques
- Neural Networks and Applications
- Vehicle Routing Optimization Methods
- Data Visualization and Analytics
- Probabilistic and Robust Engineering Design
- Advanced Clustering Algorithms Research
- Advanced Control Systems Optimization
- Optimization and Search Problems
- Control Systems and Identification
- Urban and Freight Transport Logistics
- Polynomial and algebraic computation
- Evolutionary Algorithms and Applications
- Data Management and Algorithms
- Cloud Computing and Resource Management
- Advanced Manufacturing and Logistics Optimization
- Optimization and Variational Analysis
- Optimization and Packing Problems
- Advanced Scientific Research Methods
- Constraint Satisfaction and Optimization
Vilnius University
2015-2024
Universidad de Murcia
2022
Vilnius Gediminas Technical University
2008-2012
Lithuanian Academy of Sciences
2005-2010
Institute of Mathematics and Informatics
2006-2010
Kaunas University of Technology
2002-2005
Process Systems Enterprise (United Kingdom)
2004
University College London
2004
Branch and bound methods for global optimization are considered in this paper. Advantages disadvantages of simplicial partitions branch shown. A new general combinatorial approach vertex triangulation hyper‐rectangular feasible regions is presented. Simplicial may be used to triangulate non rectangular shape defined by linear inequality constraints. Linear constraints avoid symmetries problems.
Abstract During the COVID-19 pandemic it is essential to test as many people possible, in order detect early outbreaks of infection. Present testing solutions are based on extraction RNA from patients using oropharyngeal and nasopharyngeal swabs, then with real-time PCR for presence specific filaments identifying virus. This approach limited by availability reactants, trained technicians laboratories. One ways speed up procedures a group testing, where swabs multiple grouped together tested....
The solution of multidimensional Lipschitz optimization problem requires a lot computing time and memory resources. Parallel OpenMP MPI versions branch bound algorithm with simplicial partitions bounds were created, investigated compared in this paper. efficiency the developed parallel algorithms is by solving test problems for global optimization.
The conference "Lithuanian MSc Research in Informatics and ICT" is a venue to present research of Lithuanian BSc theses informatics ICT. aim the event raise skills other students, familiarize themselves with encourage their interest scientific activities. Students from Kaunas University Technology, Vilnius Gediminas Technical University, Vilniaus kolegija gave presentations at conference.