Remigijus Paulavicius

Orcid: 0000-0003-2057-2922

According to our database1, Remigijus Paulavicius authored at least 29 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An empirical study of various candidate selection and partitioning techniques in the DIRECT framework.
J. Glob. Optim., March, 2024

Lipschitz-inspired HALRECT algorithm for derivative-free global optimization.
J. Glob. Optim., January, 2024

2023
A novel greedy genetic algorithm-based personalized travel recommendation system.
Expert Syst. Appl., November, 2023

Improving the implementation of quantum blockchain based on hypergraphs.
Quantum Inf. Process., September, 2023

2022
DIRECTGO: A New DIRECT-Type MATLAB Toolbox for Derivative-Free Global Optimization.
ACM Trans. Math. Softw., December, 2022

A MCDM-based framework for blockchain consensus protocol selection.
Expert Syst. Appl., 2022

An extensive numerical benchmark study of deterministic vs. stochastic derivative-free global optimization algorithms.
CoRR, 2022

Challenges and opportunities in applying Neural Temporal Point Processes to large scale industry data.
CoRR, 2022

2021
A new DIRECT-GLh algorithm for global optimization with hidden constraints.
Optim. Lett., 2021

Experimental Analysis of Algebraic Modelling Languages for Mathematical Optimization.
Informatica, 2021

DGO: A new DIRECT-type MATLAB toolbox for derivative-free global optimization.
CoRR, 2021

On MATLAB experience in accelerating DIRECT-GLce algorithm for constrained global optimization through dynamic data structures and parallelization.
Appl. Math. Comput., 2021

A Systematic Review and Empirical Analysis of Blockchain Simulators.
IEEE Access, 2021

An Overview and Current Status of Blockchain Simulators.
Proceedings of the IEEE International Conference on Blockchain and Cryptocurrency, 2021

2020
New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm.
J. Glob. Optim., 2020

Globally-biased BIRECT algorithm with local accelerators for expensive global optimization.
Expert Syst. Appl., 2020

BASBL: Branch-And-Sandwich BiLevel solver. Implementation and computational study with the BASBLib test set.
Comput. Chem. Eng., 2020

2019
A Decade of Blockchain: Review of the Current Status, Challenges, and Future Directions.
Informatica, 2019

2018
Improved scheme for selection of potentially optimal hyper-rectangles in DIRECT.
Optim. Lett., 2018

Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants.
J. Glob. Optim., 2018

2017
Application of Reduced-set Pareto-Lipschitzian Optimization to truss optimization.
J. Glob. Optim., 2017

2016
Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints.
Optim. Lett., 2016

2014
Simplicial Lipschitz optimization without the Lipschitz constant.
J. Glob. Optim., 2014

Globally-biased Disimpl algorithm for expensive global optimization.
J. Glob. Optim., 2014

2013
On a Hybrid MPI-Pthread Approach for Simplicial Branch-and-Bound.
Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

A Parallel DISIMPL for Pile Placement Optimization in Grillage-Type Foundations.
Proceedings of the Eighth International Conference on P2P, 2013

Dynamic and Hierarchical Load-Balancing Techniques Applied to Parallel Branch-and-Bound Methods.
Proceedings of the Eighth International Conference on P2P, 2013

2011
Parallel branch and bound for global optimization with combination of Lipschitz bounds.
Optim. Methods Softw., 2011

2010
Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds.
Optim. Lett., 2010


  Loading...