default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSebastian Sitarz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j18]Maciej Nowak, Tadeusz Trzaskalik, Sebastian Sitarz:
Interactive Multiobjective Procedure for Mixed Problems and Its Application to Capacity Planning. Entropy 23(10): 1243 (2021)
2010 – 2019
- 2019
- [j17]Tadeusz Trzaskalik
, Sebastian Sitarz, Cezary Dominiak:
Bipolar method and its modifications. Central Eur. J. Oper. Res. 27(3): 625-651 (2019) - 2014
- [j16]Sebastian Sitarz:
Multiple criteria dynamic programming and multiple knapsack problem. Appl. Math. Comput. 228: 598-605 (2014) - [j15]Sebastian Sitarz:
Parametric LP for sensitivity analysis of efficiency in MOLP problems. Optim. Lett. 8(1): 85-98 (2014) - 2013
- [j14]Sebastian Sitarz:
Compromise programming with Tchebycheff norm for discrete stochastic orders. Ann. Oper. Res. 211(1): 433-446 (2013) - [j13]Sebastian Sitarz:
The medal points' incenter for rankings in sport. Appl. Math. Lett. 26(4): 408-412 (2013) - [j12]Milan Hladík, Sebastian Sitarz:
Maximal and supremal tolerances in multiobjective linear programming. Eur. J. Oper. Res. 228(1): 93-101 (2013) - [j11]Sebastian Sitarz:
Use of the Reduced Tolerance Approach to Rank Efficient Solutions. INFOR Inf. Syst. Oper. Res. 51(3): 120-129 (2013) - 2012
- [j10]Sebastian Sitarz:
Mean value and volume-based sensitivity analysis for Olympic rankings. Eur. J. Oper. Res. 216(1): 232-238 (2012) - [j9]Sebastian Sitarz:
Interactive compromise hypersphere method and its applications. RAIRO Oper. Res. 46(3): 235-252 (2012) - 2011
- [j8]Sebastian Sitarz:
Sensitivity Analysis of Weak Efficiency in Multiple Objective Linear Programming. Asia Pac. J. Oper. Res. 28(4): 445-455 (2011) - 2010
- [j7]Sebastian Sitarz:
Standard sensitivity analysis and additive tolerance approach in MOLP. Ann. Oper. Res. 181(1): 219-232 (2010) - [j6]Sebastian Sitarz:
Dynamic programming with ordered structures: Theory, examples and applications. Fuzzy Sets Syst. 161(20): 2623-2641 (2010)
2000 – 2009
- 2009
- [j5]Sebastian Sitarz:
Pareto optimal allocations and dynamic programming. Ann. Oper. Res. 172(1): 203-219 (2009) - [j4]Sebastian Sitarz:
Ant algorithms and simulated annealing for multicriteria dynamic programming. Comput. Oper. Res. 36(2): 433-441 (2009) - 2008
- [j3]Sebastian Sitarz:
Postoptimal analysis in multicriteria linear programming. Eur. J. Oper. Res. 191(1): 7-18 (2008) - 2007
- [j2]Tadeusz Trzaskalik, Sebastian Sitarz:
Discrete dynamic programming with outcomes in random variable structures. Eur. J. Oper. Res. 177(3): 1535-1548 (2007) - 2006
- [j1]Sebastian Sitarz:
Hybrid methods in multi-criteria dynamic programming. Appl. Math. Comput. 180(1): 38-45 (2006)
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 22:49 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:
