Julius Zilinskas

According to our database1, Julius Zilinskas authored at least 63 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Scalable Bayesian optimization with generalized product of experts.
J. Glob. Optim., March, 2024

Preface.
J. Glob. Optim., March, 2024

2023
A discrete competitive facility location model with proportional and binary rules sequentially applied.
Optim. Lett., May, 2023

2021
Exact and heuristic solutions of a discrete competitive location model with Pareto-Huff customer choice rule.
J. Comput. Appl. Math., 2021

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

ILSA Data Analysis with R Packages.
Proceedings of the 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, 2021

2020
Solution of asymmetric discrete competitive facility location problems using ranking of candidate locations.
Soft Comput., 2020

Global optimization of grillage-type foundations using a distributed genetic algorithm.
J. Glob. Optim., 2020

A Discrete Competitive Facility Location Model with Minimal Market Share Constraints and Equity-Based Ties Breaking Rule.
Informatica, 2020

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

2019
Ranking-based discrete optimization algorithm for asymmetric competitive facility location.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 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

The Huff Versus the Pareto-Huff Customer Choice Rules in a Discrete Competitive Location Model.
Proceedings of the Computational Science and Its Applications - ICCSA 2018, 2018

2017
Improving solution of discrete competitive facility location problems.
Optim. Lett., 2017

On the accuracy of some absorbing boundary conditions for the Schrodinger equation.
Math. Model. Anal., 2017

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

New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior.
Comput. Oper. Res., 2017

A preference-based multi-objective evolutionary algorithm R-NSGA-II with stochastic local search.
Central Eur. J. Oper. Res., 2017

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

Solution of Discrete Competitive Facility Location Problem for Firm Expansion.
Informatica, 2016

HeteroPar 2014, APCIE 2014, and TASUS 2014 Special Issue.
Concurr. Comput. Pract. Exp., 2016

Estimating the Pareto Front of a Hard Bi-criterion Competitive Facility Location Problem.
Proceedings of the Advances in Stochastic and Deterministic Global Optimization., 2016

2015
Pareto-optimal front of cell formation problem in group technology.
J. Glob. Optim., 2015

Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems.
Commun. Nonlinear Sci. Numer. Simul., 2015

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

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

On Multidimensional Scaling with City-Block Distances.
Proceedings of the Learning and Intelligent Optimization, 2014

Parallel Shared-Memory Multi-Objective Stochastic Search for Competitive Facility Location.
Proceedings of the Euro-Par 2014: Parallel Processing Workshops, 2014

2013
A hybrid global optimization algorithm for non-linear least squares regression.
J. Glob. Optim., 2013

Parallel Multi-objective Memetic Algorithm for Competitive Facility Location.
Proceedings of the Parallel Processing and Applied Mathematics, 2013

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

Communications-Aware Process Placement Taking into Account Symmetries of Topology.
Proceedings of the Eighth International Conference on P2P, 2013

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

Electrical Energy Aware Parallel Computing with MPI and CUDA.
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

Parallel Branch and Bound for Multidimensional Scaling with L1 Distances Formulated as Quadratic Programming with Complementarity Constraints.
Proceedings of the Eighth International Conference on P2P, 2013

2012
Parallel branch and bound for multidimensional scaling with city-block distances.
J. Glob. Optim., 2012

Multimodal Evolutionary Algorithm for Multidimensional Scaling with City-Block Distances.
Informatica, 2012

Solution of Multi-Objective Competitive Facility Location Problems Using Parallel NSGA-II on Large Scale Computing Systems.
Proceedings of the Applied Parallel and Scientific Computing, 2012

On Multi-Objective Optimization Aided Visualization of Graphs Related to Business Process Diagrams.
Proceedings of the Local Proceedings and Materials of Doctoral Consortium of the Tenth International Baltic Conference on Databases and Information Systems, 2012

2011
Depth-first simplicial partition for copositivity detection, with an application to MaxClique.
Optim. Methods Softw., 2011

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

Optimal Placement of Piles in Real Grillages: Experimental Comparison of Optimization Algorithms.
Inf. Technol. Control., 2011

Copositive Programming by Simplicial Partition.
Informatica, 2011

Approaches to Parallelize Pareto Ranking in NSGA-II Algorithm.
Proceedings of the Parallel Processing and Applied Mathematics, 2011

Local optimization in global Multi-Objective Optimization Algorithms.
Proceedings of the Third World Congress on Nature & Biologically Inspired Computing, 2011

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

Interval Arithmetic Based Optimization in Nonlinear Regression.
Informatica, 2010

2009
Optimization-Based Visualization.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Global Optimization: Interval Analysis and Balanced Interval Arithmetic.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Branch and bound algorithm for multidimensional scaling with city-block metric.
J. Glob. Optim., 2009

2008
A hybrid method for multidimensional scaling using city-block distances.
Math. Methods Oper. Res., 2008

On Dimensionality of Embedding Space in Multidimensional Scaling.
Informatica, 2008

2007
Two level minimization in multidimensional scaling.
J. Glob. Optim., 2007

Parallel genetic algorithm: assessment of performance in multidimensional scaling.
Proceedings of the Genetic and Evolutionary Computation Conference, 2007

2006
Estimation of Functional Ranges Using Standard and Inner Interval Arithmetic.
Informatica, 2006

Balanced random interval arithmetic in market model estimation.
Eur. J. Oper. Res., 2006

Parallel hybrid algorithm for global optimization of problems occurring in MDS-based visualization.
Comput. Math. Appl., 2006

2005
Comparison of Packages for Interval Arithmetic.
Informatica, 2005

2004
Balanced random interval arithmetic.
Comput. Chem. Eng., 2004

On Efficiency of Tightening Bounds in Interval Global Optimization.
Proceedings of the Applied Parallel Computing, 2004

2003
Evaluation Ranges of Functions using Balanced Random Interval Arithmetic.
Informatica, 2003


  Loading...