Julius Zilinskas
Orcid: 0000-0003-1294-4298
According to our database1,
Julius Zilinskas
authored at least 64 papers
between 2003 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
Population-based algorithm for discrete facility location with ranking of candidate locations.
J. Comput. Appl. Math., 2025
2024
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
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
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
Optim. Lett., 2017
Math. Model. Anal., 2017
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
Informatica, 2016
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
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
J. Glob. Optim., 2014
J. Glob. Optim., 2014
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
J. Glob. Optim., 2013
Proceedings of the Parallel Processing and Applied Mathematics, 2013
Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013
Proceedings of the Eighth International Conference on P2P, 2013
Proceedings of the Eighth International Conference on P2P, 2013
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
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
Proceedings of the Parallel Processing and Applied Mathematics, 2011
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
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
J. Glob. Optim., 2009
2008
Math. Methods Oper. Res., 2008
2007
Proceedings of the Genetic and Evolutionary Computation Conference, 2007
2006
Informatica, 2006
Eur. J. Oper. Res., 2006
Parallel hybrid algorithm for global optimization of problems occurring in MDS-based visualization.
Comput. Math. Appl., 2006
2005
2004
Proceedings of the Applied Parallel Computing, 2004
2003
Informatica, 2003