default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJulius Zilinskas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j43]Algirdas Lancinskas
, Julius Zilinskas, Pascual Fernández, Blas Pelegrín:
Population-based algorithm for discrete facility location with ranking of candidate locations. J. Comput. Appl. Math. 457: 116304 (2025)- 2024
- [j42]Ilias S. Kotsireas, Panos M. Pardalos, Julius Zilinskas:
Preface. J. Glob. Optim. 88(3): 531-532 (2024) - [j41]Saulius Tautvaisas, Julius Zilinskas:
Scalable Bayesian optimization with generalized product of experts. J. Glob. Optim. 88(3): 777-802 (2024) - 2023
- [j40]Pascual Fernández, Algirdas Lancinskas, Blas Pelegrín, Julius Zilinskas:
A discrete competitive facility location model with proportional and binary rules sequentially applied. Optim. Lett. 17(4): 867-877 (2023) - 2021
- [j39]Linas Stripinis, Julius Zilinskas, Leocadio G. Casado, Remigijus Paulavicius:
On MATLAB experience in accelerating DIRECT-GLce algorithm for constrained global optimization through dynamic data structures and parallelization. Appl. Math. Comput. 390: 125596 (2021) - [j38]Pascual Fernández, Blas Pelegrín, Algirdas Lancinskas, Julius Zilinskas:
Exact and heuristic solutions of a discrete competitive location model with Pareto-Huff customer choice rule. J. Comput. Appl. Math. 385: 113200 (2021) - [c18]Laura Ringiene, Julius Zilinskas, Audrone Jakaitiene:
ILSA Data Analysis with R Packages. MCO 2021: 271-282 - 2020
- [j37]Remigijus Paulavicius, Yaroslav D. Sergeyev, Dmitri E. Kvasov, Julius Zilinskas:
Globally-biased BIRECT algorithm with local accelerators for expensive global optimization. Expert Syst. Appl. 144: 113052 (2020) - [j36]Pascual Fernández, Algirdas Lancinskas, Blas Pelegrín, Julius Zilinskas:
A Discrete Competitive Facility Location Model with Minimal Market Share Constraints and Equity-Based Ties Breaking Rule. Informatica 31(2): 205-224 (2020) - [j35]Mikalojus Ramanauskas, Dmitrij Sesok, Julius Zilinskas, Vadimas Starikovicius, Arnas Kaceniauskas, Rimantas Belevicius:
Global optimization of grillage-type foundations using a distributed genetic algorithm. J. Glob. Optim. 77(1): 157-173 (2020) - [j34]Algirdas Lancinskas, Julius Zilinskas, Pascual Fernández, Blas Pelegrín:
Solution of asymmetric discrete competitive facility location problems using ranking of candidate locations. Soft Comput. 24(23): 17705-17713 (2020)
2010 – 2019
- 2019
- [c17]Algirdas Lancinskas, Julius Zilinskas, Pascual Fernández, Blas Pelegrín:
Ranking-based discrete optimization algorithm for asymmetric competitive facility location. GECCO (Companion) 2019: 149-150 - 2018
- [j33]Remigijus Paulavicius, Lakhdar Chiter, Julius Zilinskas:
Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants. J. Glob. Optim. 71(1): 5-20 (2018) - [j32]Linas Stripinis, Remigijus Paulavicius, Julius Zilinskas:
Improved scheme for selection of potentially optimal hyper-rectangles in DIRECT. Optim. Lett. 12(7): 1699-1712 (2018) - [c16]Pascual Fernández, Blas Pelegrín, Algirdas Lancinskas, Julius Zilinskas:
The Huff Versus the Pareto-Huff Customer Choice Rules in a Discrete Competitive Location Model. ICCSA (2) 2018: 583-592 - 2017
- [j31]Ernestas Filatovas, Algirdas Lancinskas, Olga Kurasova, Julius Zilinskas:
A preference-based multi-objective evolutionary algorithm R-NSGA-II with stochastic local search. Central Eur. J. Oper. Res. 25(4): 859-878 (2017) - [j30]Pascual Fernández, Blas Pelegrín, Algirdas Lancinskas, Julius Zilinskas:
New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior. Comput. Oper. Res. 79: 12-18 (2017) - [j29]Jonas Mockus, Remigijus Paulavicius, Dainius Rusakevicius, Dmitrij Sesok, Julius Zilinskas:
Application of Reduced-set Pareto-Lipschitzian Optimization to truss optimization. J. Glob. Optim. 67(1-2): 425-450 (2017) - [j28]Andrej Bugajev, Raimondas Ciegis, Rima Kriauziene, Terese Leonaviciene, Julius Zilinskas:
On the accuracy of some absorbing boundary conditions for the Schrodinger equation. Math. Model. Anal. 22(3): 408-423 (2017) - [j27]Algirdas Lancinskas, Pascual Fernández, Blas Pelegrín, Julius Zilinskas:
Improving solution of discrete competitive facility location problems. Optim. Lett. 11(2): 259-270 (2017) - 2016
- [j26]Jesús Carretero, Raimondas Ciegis, Emmanuel Jeannot, Laurent Lefèvre, Gudula Rünger, Domenico Talia, Julius Zilinskas:
HeteroPar 2014, APCIE 2014, and TASUS 2014 Special Issue. Concurr. Comput. Pract. Exp. 28(3): 748-749 (2016) - [j25]Algirdas Lancinskas, Pascual Fernández, Blas Pelegrín, Julius Zilinskas:
Solution of Discrete Competitive Facility Location Problem for Firm Expansion. Informatica 27(2): 451-462 (2016) - [j24]Remigijus Paulavicius, Julius Zilinskas:
Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints. Optim. Lett. 10(2): 237-246 (2016) - [p1]Algirdas Lancinskas, Pascual Fernández, Blas Pelegrín, Julius Zilinskas:
Estimating the Pareto Front of a Hard Bi-criterion Competitive Facility Location Problem. Advances in Stochastic and Deterministic Global Optimization 2016: 255-272 - [e3]Panos M. Pardalos, Anatoly Zhigljavsky, Julius Zilinskas:
Advances in Stochastic and Deterministic Global Optimization. Springer Optimization and Its Applications 107, Springer 2016, ISBN 978-3-319-29973-0 [contents] - 2015
- [j23]Antanas Zilinskas, Julius Zilinskas:
Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems. Commun. Nonlinear Sci. Numer. Simul. 21(1-3): 89-98 (2015) - [j22]Julius Zilinskas, Boris Goldengorin, Panos M. Pardalos:
Pareto-optimal front of cell formation problem in group technology. J. Glob. Optim. 61(1): 91-108 (2015) - 2014
- [j21]Remigijus Paulavicius, Julius Zilinskas:
Simplicial Lipschitz optimization without the Lipschitz constant. J. Glob. Optim. 59(1): 23-40 (2014) - [j20]Remigijus Paulavicius, Yaroslav D. Sergeyev, Dmitri E. Kvasov, Julius Zilinskas:
Globally-biased Disimpl algorithm for expensive global optimization. J. Glob. Optim. 59(2-3): 545-567 (2014) - [c15]Algirdas Lancinskas, Pilar Martínez Ortigosa, Julius Zilinskas:
Parallel Shared-Memory Multi-Objective Stochastic Search for Competitive Facility Location. Euro-Par Workshops (1) 2014: 71-82 - [c14]Nerijus Galiauskas, Julius Zilinskas:
On Multidimensional Scaling with City-Block Distances. LION 2014: 82-87 - [e2]Luís M. B. Lopes, Julius Zilinskas, Alexandru Costan, Roberto G. Cascella, Gabor Kecskemeti, Emmanuel Jeannot, Mario Cannataro, Laura Ricci, Siegfried Benkner, Salvador Petit, Vittorio Scarano, José Gracia, Sascha Hunold, Stephen L. Scott, Stefan Lankes, Christian Lengauer, Jesús Carretero, Jens Breitbart, Michael Alexander:
Euro-Par 2014: Parallel Processing Workshops - Euro-Par 2014 International Workshops, Porto, Portugal, August 25-26, 2014, Revised Selected Papers, Part I. Lecture Notes in Computer Science 8805, Springer 2014, ISBN 978-3-319-14324-8 [contents] - [e1]Luís M. B. Lopes, Julius Zilinskas, Alexandru Costan, Roberto G. Cascella, Gabor Kecskemeti, Emmanuel Jeannot, Mario Cannataro, Laura Ricci, Siegfried Benkner, Salvador Petit, Vittorio Scarano, José Gracia, Sascha Hunold, Stephen L. Scott, Stefan Lankes, Christian Lengauer, Jesús Carretero, Jens Breitbart, Michael Alexander:
Euro-Par 2014: Parallel Processing Workshops - Euro-Par 2014 International Workshops, Porto, Portugal, August 25-26, 2014, Revised Selected Papers, Part II. Lecture Notes in Computer Science 8806, Springer 2014, ISBN 978-3-319-14312-5 [contents] - 2013
- [j19]Antanas Zilinskas, Julius Zilinskas:
A hybrid global optimization algorithm for non-linear least squares regression. J. Glob. Optim. 56(2): 265-277 (2013) - [c13]Juan F. R. Herrera, Leocadio G. Casado, Eligius M. T. Hendrix, Remigijus Paulavicius, Julius Zilinskas:
Dynamic and Hierarchical Load-Balancing Techniques Applied to Parallel Branch-and-Bound Methods. 3PGCIC 2013: 497-502 - [c12]Nerijus Galiauskas, Julius Zilinskas:
Parallel Branch and Bound for Multidimensional Scaling with L1 Distances Formulated as Quadratic Programming with Complementarity Constraints. 3PGCIC 2013: 509-512 - [c11]Remigijus Paulavicius, Julius Zilinskas, Juan F. R. Herrera, Leocadio G. Casado:
A Parallel DISIMPL for Pile Placement Optimization in Grillage-Type Foundations. 3PGCIC 2013: 525-530 - [c10]Aleksandr Igumenov, Julius Zilinskas:
Electrical Energy Aware Parallel Computing with MPI and CUDA. 3PGCIC 2013: 531-536 - [c9]Julius Zilinskas:
Communications-Aware Process Placement Taking into Account Symmetries of Topology. 3PGCIC 2013: 537-542 - [c8]Juan F. R. Herrera, Leocadio G. Casado, Remigijus Paulavicius, Julius Zilinskas, Eligius M. T. Hendrix:
On a Hybrid MPI-Pthread Approach for Simplicial Branch-and-Bound. IPDPS Workshops 2013: 1764-1770 - [c7]Algirdas Lancinskas, Julius Zilinskas:
Parallel Multi-objective Memetic Algorithm for Competitive Facility Location. PPAM (2) 2013: 354-363 - 2012
- [j18]Juana López Redondo, Pilar Martínez Ortigosa, Julius Zilinskas:
Multimodal Evolutionary Algorithm for Multidimensional Scaling with City-Block Distances. Informatica 23(4): 601-620 (2012) - [j17]Julius Zilinskas:
Parallel branch and bound for multidimensional scaling with city-block distances. J. Glob. Optim. 54(2): 261-274 (2012) - [c6]Vytautas Jancauskas, Giedrius Kaukas, Antanas Zilinskas, Julius Zilinskas:
On Multi-Objective Optimization Aided Visualization of Graphs Related to Business Process Diagrams. DB&Local Proceedings 2012: 71-80 - [c5]Algirdas Lancinskas, Julius Zilinskas:
Solution of Multi-Objective Competitive Facility Location Problems Using Parallel NSGA-II on Large Scale Computing Systems. PARA 2012: 422-433 - 2011
- [j16]Julius Zilinskas:
Copositive Programming by Simplicial Partition. Informatica 22(4): 601-614 (2011) - [j15]Rimantas Belevicius, Sergejus Ivanikovas, Dmitrij Sesok, Saulius Valentinavicius, Julius Zilinskas:
Optimal Placement of Piles in Real Grillages: Experimental Comparison of Optimization Algorithms. Inf. Technol. Control. 40(2): 123-132 (2011) - [j14]Remigijus Paulavicius, Julius Zilinskas, Andreas Grothey:
Parallel branch and bound for global optimization with combination of Lipschitz bounds. Optim. Methods Softw. 26(3): 487-498 (2011) - [j13]Julius Zilinskas, Mirjam Dür:
Depth-first simplicial partition for copositivity detection, with an application to MaxClique. Optim. Methods Softw. 26(3): 499-510 (2011) - [c4]Algirdas Lancinskas, Julius Zilinskas, Pilar Martínez Ortigosa:
Local optimization in global Multi-Objective Optimization Algorithms. NaBIC 2011: 323-328 - [c3]Algirdas Lancinskas, Julius Zilinskas:
Approaches to Parallelize Pareto Ranking in NSGA-II Algorithm. PPAM (2) 2011: 371-380 - 2010
- [j12]Antanas Zilinskas, Julius Zilinskas:
Interval Arithmetic Based Optimization in Nonlinear Regression. Informatica 21(1): 149-158 (2010) - [j11]Remigijus Paulavicius, Julius Zilinskas, Andreas Grothey:
Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds. Optim. Lett. 4(2): 173-183 (2010)
2000 – 2009
- 2009
- [j10]Antanas Zilinskas, Julius Zilinskas:
Branch and bound algorithm for multidimensional scaling with city-block metric. J. Glob. Optim. 43(2-3): 357-372 (2009) - [r2]Julius Zilinskas, Ian David Lockhart Bogle:
Global Optimization: Interval Analysis and Balanced Interval Arithmetic. Encyclopedia of Optimization 2009: 1346-1350 - [r1]Antanas Zilinskas, Julius Zilinskas:
Optimization-Based Visualization. Encyclopedia of Optimization 2009: 2785-2791 - 2008
- [j9]Julius Zilinskas:
On Dimensionality of Embedding Space in Multidimensional Scaling. Informatica 19(3): 447-460 (2008) - [j8]Antanas Zilinskas, Julius Zilinskas:
A hybrid method for multidimensional scaling using city-block distances. Math. Methods Oper. Res. 68(3): 429-443 (2008) - 2007
- [j7]Antanas Zilinskas, Julius Zilinskas:
Two level minimization in multidimensional scaling. J. Glob. Optim. 38(4): 581-596 (2007) - [c2]Antanas Zilinskas, Julius Zilinskas:
Parallel genetic algorithm: assessment of performance in multidimensional scaling. GECCO 2007: 1492-1501 - 2006
- [j6]Antanas Zilinskas, Julius Zilinskas:
Parallel hybrid algorithm for global optimization of problems occurring in MDS-based visualization. Comput. Math. Appl. 52(1-2): 211-224 (2006) - [j5]Julius Zilinskas, Ian David Lockhart Bogle:
Balanced random interval arithmetic in market model estimation. Eur. J. Oper. Res. 175(3): 1367-1378 (2006) - [j4]Julius Zilinskas:
Estimation of Functional Ranges Using Standard and Inner Interval Arithmetic. Informatica 17(1): 125-136 (2006) - 2005
- [j3]Julius Zilinskas:
Comparison of Packages for Interval Arithmetic. Informatica 16(1): 145-154 (2005) - 2004
- [j2]Julius Zilinskas, Ian David Lockhart Bogle:
Balanced random interval arithmetic. Comput. Chem. Eng. 28(5): 839-851 (2004) - [c1]Antanas Zilinskas, Julius Zilinskas:
On Efficiency of Tightening Bounds in Interval Global Optimization. PARA 2004: 197-205 - 2003
- [j1]Julius Zilinskas, Ian David Lockhart Bogle:
Evaluation Ranges of Functions using Balanced Random Interval Arithmetic. Informatica 14(3): 403-416 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
