default search action
Dmitry Krass
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j49]David Chapela-Campa
, Ismail Benchekroun, Opher Baron, Marlon Dumas, Dmitry Krass, Arik Senderovich:
A framework for measuring the quality of business process simulation models. Inf. Syst. 127: 102447 (2025) - 2024
- [j48]Opher Baron
Supervised ML for Solving the GI/GI/1 Queue. INFORMS J. Comput. 36(3): 766-786 (2024) - [j47]Vahid Roshanaei
An Interactive Spreadsheet Model for Teaching Classification Using Logistic Regression. INFORMS Trans. Educ. 25(1): 55-80 (2024) - [d2]David Chapela-Campa
Evaluation datasets and results of the paper "A Framework for Measuring the Quality of Business Process Simulation Models". Version 2.0. Zenodo, 2024 [all versions] - [i3]Eliran Sherzer, Opher Baron, Dmitry Krass, Yehezkel Resheff:
Approximating G(t)/GI/1 queues with deep learning. CoRR abs/2407.08765 (2024) - 2023
- [c2]David Chapela-Campa
Can I Trust My Simulation Model? Measuring the Quality of Business Process Simulation Models. BPM 2023: 20-37 - [d1]David Chapela-Campa
Evaluation datasets and results of the paper "Can I Trust My Simulation Model? Measuring the Quality of Business Process Simulation Models". Version 1.0. Zenodo, 2023 [all versions] - [i2]David Chapela-Campa, Ismail Benchekroun, Opher Baron
Can I Trust My Simulation Model? Measuring the Quality of Business Process Simulation Models. CoRR abs/2303.17463 (2023) - 2022
- [c1]Opher Baron
Can Machines Solve General Queueing Problems? WSC 2022: 2830-2841 - [i1]Eliran Sherzer, Arik Senderovich, Opher Baron, Dmitry Krass:
Can machines solve general queueing systems? CoRR abs/2202.01729 (2022) - 2021
- [j46]Igor Averbakh
Location problems with continuous demand and unreliable facilities: Applications of families of incremental Voronoi diagrams. Discret. Appl. Math. 300: 36-55 (2021) - [j45]Robert Aboolian
Optimizing facility location and design. Eur. J. Oper. Res. 289(1): 31-43 (2021)
2010 – 2019
- 2019
- [j44]Oded Berman, Zvi Drezner, Dmitry Krass:
The multiple gradual cover location problem. J. Oper. Res. Soc. 70(6): 931-940 (2019) - [j43]Oded Berman, Mohammad M. Fazel-Zarandi
Truthful Cheap Talk: Why Operational Flexibility May Lead to Truthful Communication. Manag. Sci. 65(4): 1624-1641 (2019) - 2017
- [j42]Opher Baron
Strategic Idleness and Dynamic Scheduling in an Open-Shop Service Network: Case Study and Analysis. Manuf. Serv. Oper. Manag. 19(1): 52-71 (2017) - 2016
- [j41]Oded Berman, Jörg Kalcsics
On covering location problems on networks with edge demand. Comput. Oper. Res. 74: 214-227 (2016) - 2015
- [j40]Igor Averbakh, Oded Berman, Jörg Kalcsics
Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand. Oper. Res. 63(2): 394-411 (2015) - 2014
- [j39]Opher Baron
Using Strategic Idleness to Improve Customer Service Experience in Service Networks. Oper. Res. 62(1): 123-140 (2014) - [j38]Vahideh Sadat Abedi, Oded Berman, Dmitry Krass:
Supporting New Product or Service Introductions: Location, Marketing, and Word of Mouth. Oper. Res. 62(5): 994-1013 (2014) - [j37]Igor Averbakh, Oded Berman, Dmitry Krass, Jörg Kalcsics
Cooperative covering problems on networks. Networks 63(4): 334-349 (2014) - 2013
- [j36]Oded Berman, Zvi Drezner, Dmitry Krass:
Continuous covering and cooperative covering problems with a general decay function on networks. J. Oper. Res. Soc. 64(11): 1644-1653 (2013) - 2012
- [j35]Oded Berman, Dmitry Krass, M. Mahdi Tajbakhsh:
A coordinated location-inventory model. Eur. J. Oper. Res. 217(3): 500-508 (2012) - [j34]Robert Aboolian
Profit Maximizing Distributed Service System Design with Congestion and Elastic Demand. Transp. Sci. 46(2): 247-261 (2012) - 2011
- [j33]Oded Berman, Dmitry Krass, Jiamin Wang:
The probabilistic gradual covering location problem on a network with discrete random demand weights. Comput. Oper. Res. 38(11): 1493-1500 (2011) - [j32]Oded Berman, Eduard Ianovsky, Dmitry Krass:
Optimal search path for service in the presence of disruptions. Comput. Oper. Res. 38(11): 1562-1571 (2011) - [j31]Oded Berman, Dmitry Krass:
On n-facility median problem with facilities subject to failure facing uniform demand. Discret. Appl. Math. 159(6): 420-432 (2011) - [j30]Oded Berman, Zvi Drezner, Dmitry Krass:
Discrete cooperative covering problems. J. Oper. Res. Soc. 62(11): 2002-2012 (2011) - [j29]Oded Berman, Zvi Drezner, Dmitry Krass:
Big segment small segment global optimization algorithm on networks. Networks 58(1): 1-11 (2011) - 2010
- [j28]Oded Berman, Zvi Drezner, Dmitry Krass:
Generalized coverage: New developments in covering location models. Comput. Oper. Res. 37(10): 1675-1687 (2010) - [j27]Dmitry Krass, Anton Ovchinnikov:
Constrained group balancing: Why does it work. Eur. J. Oper. Res. 206(1): 144-154 (2010)
2000 – 2009
- 2009
- [j26]Robert Aboolian
Efficient solution approaches for a discrete multi-facility competitive interaction model. Ann. Oper. Res. 167(1): 297-306 (2009) - [j25]Oded Berman, Jörg Kalcsics
The Ordered Gradual Covering Location Problem on a Network. Discret. Appl. Math. 157(18): 3689-3707 (2009) - [j24]Oded Berman, Dmitry Krass, Mozart B. C. Menezes
Locating Facilities in the Presence of Disruptions and Incomplete Information. Decis. Sci. 40(4): 845-868 (2009) - [j23]Oded Berman, Zvi Drezner, Dmitry Krass, George O. Wesolowsky:
The variable radius covering problem. Eur. J. Oper. Res. 196(2): 516-525 (2009) - 2008
- [j22]Robert Aboolian
Optimizing pricing and location decisions for competitive service facilities charging uniform price. J. Oper. Res. Soc. 59(11): 1506-1519 (2008) - [j21]Opher Baron
Facility Location with Stochastic Demand and Constraints on Waiting Time. Manuf. Serv. Oper. Manag. 10(3): 484-505 (2008) - 2007
- [j20]Robert Aboolian
Competitive facility location model with concave demand. Eur. J. Oper. Res. 181(2): 598-619 (2007) - [j19]Robert Aboolian
Competitive facility location and design problem. Eur. J. Oper. Res. 182(1): 40-62 (2007) - [j18]Opher Baron
The equitable location problem on the plane. Eur. J. Oper. Res. 183(2): 578-590 (2007) - [j17]Oded Berman, Dmitry Krass, Mozart B. C. Menezes
Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects. Oper. Res. 55(2): 332-350 (2007) - 2006
- [j16]Dmitry Krass, Anton Ovchinnikov:
The University of Toronto's Rotman School of Management Uses Management Science to Create MBA Study Groups. Interfaces 36(2): 126-137 (2006) - 2005
- [j15]Oded Berman, Dmitry Krass:
An Improved IP Formulation for the Uncapacitated Facility Location Problem: Capitalizing on Objective Function Structure. Ann. Oper. Res. 136(1): 21-34 (2005) - 2003
- [j14]Oded Berman, Dmitry Krass, Zvi Drezner:
The gradual covering decay location problem on a network. Eur. J. Oper. Res. 151(3): 474-480 (2003) - [j13]Oded Berman, Dmitry Krass, David Perry:
A transfer/clearing inventory model under sporadic review. Math. Methods Oper. Res. 57(2): 329-344 (2003) - 2002
- [j12]Oded Berman, Dmitry Krass:
Recent Developments in the Theory and Applications of Location Models: A Preview. Ann. Oper. Res. 110(1-4): 15-16 (2002) - [j11]Oded Berman, Dmitry Krass:
Recent Developments in the Theory and Applications of Location Models: A Preview. Ann. Oper. Res. 111(1-4): 15-16 (2002) - [j10]Oded Berman, Dmitry Krass:
Locating Multiple Competitive Facilities: Spatial Interaction Models with Variable Expenditures. Ann. Oper. Res. 111(1-4): 197-225 (2002) - [j9]Oded Berman, Dmitry Krass:
The generalized maximal covering location problem. Comput. Oper. Res. 29(6): 563-581 (2002) - [j8]Dmitry Krass, O. J. Vrieze:
Achieving Target State-Action Frequencies in Multichain Average-Reward Markov Decision Processes. Math. Oper. Res. 27(3): 545-566 (2002) - 2001
- [j7]Frank Y. Chen, Dmitry Krass:
Analysis of supply contracts with minimum total order quantity commitments and non-stationary demands. Eur. J. Oper. Res. 131(2): 309-323 (2001) - [j6]Frank Y. Chen, Dmitry Krass:
Inventory models with minimal service level constraints. Eur. J. Oper. Res. 134(1): 120-140 (2001)
1990 – 1999
- 1995
- [j5]Oded Berman, Dmitry Krass, Chen Wei Xu:
Locating flow-intercepting facilities: New approaches and results. Ann. Oper. Res. 60(1): 121-143 (1995) - [j4]Jerzy A. Filar
Percentile performance criteria for limiting average Markov decision processes. IEEE Trans. Autom. Control. 40(1): 2-10 (1995) - [j3]Oded Berman, Dmitry Krass, Chen Wei Xu:
Locating Discretionary Service Facilities Based on Probabilistic Customer Flows. Transp. Sci. 29(3): 276-290 (1995) - 1994
- [j2]Jerzy A. Filar, Dmitry Krass:
Hamiltonian Cycles and Markov Chains. Math. Oper. Res. 19(1): 223-237 (1994) - 1992
- [j1]Dmitry Krass, Jerzy A. Filar, Sagnik S. Sinha:
A Weighted Markov Decision Process. Oper. Res. 40(6): 1180-1187 (1992)
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-10-23 20:33 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: