default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJulius Zilinskas
- > Home > Persons > Julius Zilinskas
Publications
- 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
- [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) - 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) - [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) - 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
- [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) - [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
- [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) - [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 - 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 - 2013
- [c7]Algirdas Lancinskas, Julius Zilinskas:
Parallel Multi-objective Memetic Algorithm for Competitive Facility Location. PPAM (2) 2013: 354-363 - 2012
- [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
- [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
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 2024-04-24 23:10 CEST 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:
