Dmitry Krass

Eur. J. Oper. Res., 2021

Location problems with continuous demand and unreliable facilities: Applications of families of incremental Voronoi diagrams.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

2019

Truthful Cheap Talk: Why Operational Flexibility May Lead to Truthful Communication.

[BibT_eX]

[DOI]

Mohammad M. Fazel-Zarandi

Manag. Sci., 2019

The multiple gradual cover location problem.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2019

2017

Strategic Idleness and Dynamic Scheduling in an Open-Shop Service Network: Case Study and Analysis.

[BibT_eX]

[DOI]

Manuf. Serv. Oper. Manag., 2017

2016

On covering location problems on networks with edge demand.

[BibT_eX]

[DOI]

Jörg Kalcsics

Comput. Oper. Res., 2016

2015

Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand.

[BibT_eX]

[DOI]

Oper. Res., 2015

2014

Cooperative covering problems on networks.

[BibT_eX]

[DOI]

Networks, 2014

Using Strategic Idleness to Improve Customer Service Experience in Service Networks.

[BibT_eX]

[DOI]

Oper. Res., 2014

Supporting New Product or Service Introductions: Location, Marketing, and Word of Mouth.

[BibT_eX]

[DOI]

Vahideh Sadat Abedi

Oper. Res., 2014

2013

Continuous covering and cooperative covering problems with a general decay function on networks.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2013

2012

Profit Maximizing Distributed Service System Design with Congestion and Elastic Demand.

[BibT_eX]

[DOI]

Transp. Sci., 2012

A coordinated location-inventory model.

[BibT_eX]

[DOI]

M. Mahdi Tajbakhsh

Eur. J. Oper. Res., 2012

2011

Big segment small segment global optimization algorithm on networks.

[BibT_eX]

[DOI]

Networks, 2011

Discrete cooperative covering problems.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2011

On n-facility median problem with facilities subject to failure facing uniform demand.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

The probabilistic gradual covering location problem on a network with discrete random demand weights.

[BibT_eX]

[DOI]

Jiamin Wang

Comput. Oper. Res., 2011

Optimal search path for service in the presence of disruptions.

[BibT_eX]

[DOI]

Eduard Ianovsky

Comput. Oper. Res., 2011

2010

Constrained group balancing: Why does it work.

[BibT_eX]

[DOI]

Anton Ovchinnikov

Eur. J. Oper. Res., 2010

Generalized coverage: New developments in covering location models.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2010

2009

The variable radius covering problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2009

Locating Facilities in the Presence of Disruptions and Incomplete Information.

[BibT_eX]

[DOI]

Mozart B. C. Menezes

Decis. Sci., 2009

The Ordered Gradual Covering Location Problem on a Network.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Efficient solution approaches for a discrete multi-facility competitive interaction model.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2009

2008

Facility Location with Stochastic Demand and Constraints on Waiting Time.

[BibT_eX]

[DOI]

Opher Baron

Manuf. Serv. Oper. Manag., 2008

Optimizing pricing and location decisions for competitive service facilities charging uniform price.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2008

2007

Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects.

[BibT_eX]

[DOI]

Mozart B. C. Menezes

Oper. Res., 2007

The equitable location problem on the plane.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2007

Competitive facility location and design problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2007

Competitive facility location model with concave demand.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2007

2006

The University of Toronto's Rotman School of Management Uses Management Science to Create MBA Study Groups.

[BibT_eX]

[DOI]

Anton Ovchinnikov

Interfaces, 2006

2005

An Improved IP Formulation for the Uncapacitated Facility Location Problem: Capitalizing on Objective Function Structure.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2005

2003

A transfer/clearing inventory model under sporadic review.

[BibT_eX]

[DOI]

David Perry

Math. Methods Oper. Res., 2003

The gradual covering decay location problem on a network.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2003

2002

Achieving Target State-Action Frequencies in Multichain Average-Reward Markov Decision Processes.

[BibT_eX]

[DOI]

O. J. Vrieze

Math. Oper. Res., 2002

The generalized maximal covering location problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2002

Locating Multiple Competitive Facilities: Spatial Interaction Models with Variable Expenditures.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2002

Recent Developments in the Theory and Applications of Location Models: A Preview.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2002

2001

Analysis of supply contracts with minimum total order quantity commitments and non-stationary demands.

[BibT_eX]

[DOI]

Frank Y. Chen

Eur. J. Oper. Res., 2001

Inventory models with minimal service level constraints.

[BibT_eX]

[DOI]

Frank Y. Chen

Eur. J. Oper. Res., 2001

1995

Locating Discretionary Service Facilities Based on Probabilistic Customer Flows.

[BibT_eX]

[DOI]

Chen Wei Xu

Transp. Sci., 1995

Percentile performance criteria for limiting average Markov decision processes.

[BibT_eX]

[DOI]

Jerzy A. Filar

Keith Ross

IEEE Trans. Autom. Control., 1995

Locating flow-intercepting facilities: New approaches and results.

[BibT_eX]

[DOI]

Chen Wei Xu

Ann. Oper. Res., 1995

1994

Hamiltonian Cycles and Markov Chains.

[BibT_eX]

[DOI]

Jerzy A. Filar

Math. Oper. Res., 1994

1992

A Weighted Markov Decision Process.

[BibT_eX]

[DOI]