default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPawel Jan Kalczynski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j37]Malgorzata Miklas-Kalczynska, Pawel Jan Kalczynski:
Multiple obnoxious facility location: the case of protected areas. Comput. Manag. Sci. 21(1): 23 (2024)- [j36]Jack Brimberg, Pawel Jan Kalczynski, Zvi Drezner
:
Different formulations of the gray pattern problem and their optimal solutions. Eur. J. Oper. Res. 316(1): 61-71 (2024) - [j35]Zvi Drezner, Morton E. O'Kelly, Pawel Jan Kalczynski:
Stochastic location models applied to multipurpose shopping trips. J. Oper. Res. Soc. 75(8): 1524-1534 (2024) - [j34]Keaton Coletti, Pawel Jan Kalczynski, Zvi Drezner:
On the combined inverse-square effect of multiple points in multidimensional space. Oper. Res. Lett. 55: 107139 (2024) - 2023
- [j33]Richard L. Church, Zvi Drezner, Pawel Jan Kalczynski:
Extensions to the planar p-median problem. Ann. Oper. Res. 326(1): 115-135 (2023) - [j32]Jack Brimberg, Pawel Jan Kalczynski, Zvi Drezner:
The repeated p-dispersion problem. INFOR Inf. Syst. Oper. Res. 61(2): 233-255 (2023) - [j31]Pawel Jan Kalczynski, Zvi Goldstein, Zvi Drezner:
An Efficient Heuristic for the k-Partitioning Problem. Oper. Res. Forum 4(4): 70 (2023) - 2022
- [j30]Pawel Jan Kalczynski, Atsuo Suzuki, Zvi Drezner:
Multiple obnoxious facilities with weighted demand points. J. Oper. Res. Soc. 73(3): 598-607 (2022) - [j29]Zvi Drezner, Pawel Jan Kalczynski, Alfonsas Misevicius, Gintaras Palubeckis:
Finding optimal solutions to several gray pattern instances. Optim. Lett. 16(2): 713-722 (2022) - [j28]Pawel Jan Kalczynski, Zvi Drezner:
Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location. Optim. Lett. 16(4): 1153-1166 (2022) - 2021
- [j27]Tammy Drezner, Zvi Drezner, Pawel Jan Kalczynski:
Directional approach to gradual cover: the continuous case. Comput. Manag. Sci. 18(1): 25-47 (2021) - [j26]Pawel Jan Kalczynski, Zvi Drezner:
The obnoxious facilities planar p-median problem. OR Spectr. 43(2): 577-593 (2021) - 2020
- [j25]Tammy Drezner, Zvi Drezner, Pawel Jan Kalczynski:
Directional approach to gradual cover: a maximin objective. Comput. Manag. Sci. 17(1): 121-139 (2020) - [j24]Tammy Drezner, Zvi Drezner, Pawel Jan Kalczynski:
Multiple obnoxious facilities location: A cooperative model. IISE Trans. 52(12): 1403-1412 (2020) - [j23]Zvi Drezner, Pawel Jan Kalczynski:
Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming. Int. Trans. Oper. Res. 27(3): 1320-1342 (2020) - [j22]Tammy Drezner, Zvi Drezner, Pawel Jan Kalczynski:
Gradual cover competitive facility location. OR Spectr. 42(2): 333-354 (2020) - [i3]Tammy Drezner, Zvi Drezner, Pawel Jan Kalczynski:
Directional approach to gradual cover: the continuous case. CoRR abs/2004.03035 (2020) - [i2]Pawel Jan Kalczynski, Jack Brimberg, Zvi Drezner:
The Importance of Good Starting Solutions in the Minimum Sum of Squares Clustering Problem. CoRR abs/2004.04593 (2020) - [i1]Pawel Jan Kalczynski, Atsuo Suzuki, Zvi Drezner:
Obnoxious facility location: the case of weighted demand points. CoRR abs/2008.04386 (2020)
2010 – 2019
- 2019
- [j21]Pawel Jan Kalczynski, Zvi Drezner:
Locating multiple facilities using the max-sum objective. Comput. Ind. Eng. 129: 136-143 (2019) - [j20]Tammy Drezner, Zvi Drezner, Pawel Jan Kalczynski:
The planar multifacility collection depots location problem. Comput. Oper. Res. 102: 121-129 (2019) - 2017
- [j19]Zvi Drezner, Pawel Jan Kalczynski:
The continuous grey pattern problem. J. Oper. Res. Soc. 68(5): 469-483 (2017) - 2016
- [j18]Tammy Drezner, Zvi Drezner, Pawel Jan Kalczynski:
The multiple markets competitive location problem. Kybernetes 45(6): 854-865 (2016) - 2015
- [j17]Tammy Drezner, Zvi Drezner, Pawel Jan Kalczynski:
A leader-follower model for discrete competitive facility location. Comput. Oper. Res. 64: 51-59 (2015) - [j16]Pawel Jan Kalczynski, Dawit Zerom:
Price forecast valuation for the NYISO electricity market. Kybernetes 44(4): 490-504 (2015) - 2014
- [j15]Sylvain Senecal, Pawel Jan Kalczynski, Marc Fredette:
Dynamic identification of anonymous consumers' visit goals using clickstream. Int. J. Electron. Bus. 11(3): 220-233 (2014) - 2012
- [j14]Pawel Jan Kalczynski, Jerzy Kamburowski:
An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times. Comput. Oper. Res. 39(11): 2659-2665 (2012) - [j13]Pawel Jan Kalczynski:
A discrete model for optimal operation of fossil-fuel generators of electricity. Eur. J. Oper. Res. 216(3): 679-686 (2012) - [j12]Tammy Drezner, Zvi Drezner, Pawel Jan Kalczynski:
Strategic competitive location: improving existing and establishing new facilities. J. Oper. Res. Soc. 63(12): 1720-1730 (2012) - 2011
- [j11]Tammy Drezner, Zvi Drezner, Pawel Jan Kalczynski:
A cover-based competitive location model. J. Oper. Res. Soc. 62(1): 100-113 (2011)
2000 – 2009
- 2009
- [j10]Pawel Jan Kalczynski, Jerzy Kamburowski:
An empirical analysis of the optimality rate of flow shop heuristics. Eur. J. Oper. Res. 198(1): 93-101 (2009) - 2008
- [j9]Pawel Jan Kalczynski, Jerzy Kamburowski:
An improved NEH heuristic to minimize makespan in permutation flow shops. Comput. Oper. Res. 35(9): 3001-3008 (2008) - 2007
- [j8]Pawel Jan Kalczynski, Jerzy Kamburowski:
On no-wait and no-idle flow shops with makespan criterion. Eur. J. Oper. Res. 178(3): 677-685 (2007) - 2006
- [j7]Pawel Jan Kalczynski, Jerzy Kamburowski:
A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation. Eur. J. Oper. Res. 169(3): 742-750 (2006) - [j6]Pawel Jan Kalczynski, Sylvain Senecal, Jacques Nantel:
Predicting On-Line Task Completion with Clickstream Complexity Measures: A Graph-Based Approach. Int. J. Electron. Commer. 10(3): 121-141 (2006) - [c3]Maria Antonina Mach, Pawel Jan Kalczynski:
Technique for Reducing the Number of Rules in a Temporal Knowledge Base. BIS 2006: 442-454 - 2005
- [j5]Pawel Jan Kalczynski, Jerzy Kamburowski:
A heuristic for minimizing the makespan in no-idle permutation flow shops. Comput. Ind. Eng. 49(1): 146-154 (2005) - [j4]Pawel Jan Kalczynski, Amy Chou:
Temporal Document Retrieval Model for business news archives. Inf. Process. Manag. 41(3): 635-650 (2005) - [j3]Pawel Jan Kalczynski:
A Java Implementation of the Branch and Bound Algorithm: The Asymmetric Traveling Salesman Problem. J. Object Technol. 4(1): 155-164 (2005) - [j2]Pawel Jan Kalczynski, Jerzy Kamburowski:
Two-Machine Stochastic Flow Shops With Blocking and the Traveling Salesman Problem. J. Sched. 8(6): 529-536 (2005) - [r1]Krzysztof Wecel, Witold Abramowicz, Pawel Jan Kalczynski:
Enhanced Knowledge Warehouse. Encyclopedia of Information Science and Technology (II) 2005: 1057-1063 - 2004
- [j1]Pawel Jan Kalczynski, Jerzy Kamburowski:
Generalization of Johnson's and Talwar's scheduling rules in two-machine stochastic flow shops. J. Oper. Res. Soc. 55(12): 1358-1362 (2004) - 2002
- [b1]Witold Abramowicz, Pawel Jan Kalczynski, Krzysztof Wecel:
Filtering the web to feed data warehouses. Springer 2002, ISBN 978-1-85233-579-3, pp. I-XII, 1-267 - [c2]Witold Abramowicz, Malgorzata Miklas-Kalczynska, Pawel Jan Kalczynski:
A Tool for Image Categorization to Support Information Filtering. IS 2002: 215-220 - 2001
- [c1]Witold Abramowicz, Pawel Jan Kalczynski, Krzysztof Wecel:
Information Ants to Filter Business Information from Internet Sources. CAINE 2001: 134-137
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 2024-08-23 19:21 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:
