Local optimization in global Multi-Objective Optimization Algorithms. - Algirdas Lancinskas; Julius Zilinskas; Pilar Martínez Ortigosa (NaBIC, 2011)

Approaches to Parallelize Pareto Ranking in NSGA-II Algorithm. - Algirdas Lancinskas; Julius Zilinskas (PPAM (2), 2011)

Solution of Multi-Objective Competitive Facility Location Problems Using Parallel NSGA-II on Large Scale Computing Systems. - Algirdas Lancinskas; Julius Zilinskas (PARA, 2012)

Parallel Multi-objective Memetic Algorithm for Competitive Facility Location. - Algirdas Lancinskas; Julius Zilinskas (PPAM (2), 2013)

Parallel Shared-Memory Multi-Objective Stochastic Search for Competitive Facility Location. - Algirdas Lancinskas; Pilar Martínez Ortigosa; Julius Zilinskas (Euro-Par Workshops (1), 2014)

Effect of Diffusion Limitations on Multianalyte Determination from Biased Biosensor Response. - Romas Baronas; Juozas Kulys; Algirdas Lancinskas; Antanas Zilinskas (Sensors, 2014)

On Benchmarking Stochastic Global Optimization Algorithms. - Eligius M. T. Hendrix; Algirdas Lancinskas (Informatica, 2015)

Estimating the Pareto Front of a Hard Bi-criterion Competitive Facility Location Problem. - Algirdas Lancinskas; Pascual Fernández; Blas Pelegrín; Julius Zilinskas (Advances in Stochastic and Deterministic Global Optimization, 2016)

Solution of Discrete Competitive Facility Location Problem for Firm Expansion. - Algirdas Lancinskas; Pascual Fernández; Blas Pelegrín; Julius Zilinskas (Informatica, 2016)

Single and multi-objective genetic algorithms for the container loading problem. - Gara Miranda; Algirdas Lancinskas; Yanira González (GECCO (Companion), 2017)

A preference-based multi-objective evolutionary algorithm R-NSGA-II with stochastic local search. - Ernestas Filatovas; Algirdas Lancinskas; Olga Kurasova; Julius Zilinskas (Central Eur. J. Oper. Res., 2017)

New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior. - Pascual Fernández; Blas Pelegrín; Algirdas Lancinskas; Julius Zilinskas (Comput. Oper. Res., 2017)

Improving solution of discrete competitive facility location problems. - Algirdas Lancinskas; Pascual Fernández; Blas Pelegrín; Julius Zilinskas (Optim. Lett., 2017)

The Huff Versus the Pareto-Huff Customer Choice Rules in a Discrete Competitive Location Model. - Pascual Fernández; Blas Pelegrín; Algirdas Lancinskas; Julius Zilinskas (ICCSA (2), 2018)

Ranking-based discrete optimization algorithm for asymmetric competitive facility location. - Algirdas Lancinskas; Julius Zilinskas; Pascual Fernández; Blas Pelegrín (GECCO (Companion), 2019)

A Discrete Competitive Facility Location Model with Minimal Market Share Constraints and Equity-Based Ties Breaking Rule. - Pascual Fernández; Algirdas Lancinskas; Blas Pelegrín; Julius Zilinskas (Informatica, 2020)

Solution of asymmetric discrete competitive facility location problems using ranking of candidate locations. - Algirdas Lancinskas; Julius Zilinskas; Pascual Fernández; Blas Pelegrín (Soft Comput., 2020)

Exact and heuristic solutions of a discrete competitive location model with Pareto-Huff customer choice rule. - Pascual Fernández; Blas Pelegrín; Algirdas Lancinskas; Julius Zilinskas (J. Comput. Appl. Math., 2021)

A discrete competitive facility location model with proportional and binary rules sequentially applied. - Pascual Fernández; Algirdas Lancinskas; Blas Pelegrín; Julius Zilinskas (Optim. Lett., 2023)

Population-based algorithm for discrete facility location with ranking of candidate locations. - Algirdas Lancinskas; Julius Zilinskas; Pascual Fernández; Blas Pelegrín (J. Comput. Appl. Math., 2025)