2025
Re-direction in queueing networks with two customer types: The inter-departure analysis.
Comput. Oper. Res., 2025
2022
Probabilistic Set Covering Location Problem in Congested Networks.
Transp. Sci., 2022
The multifacility center problems with random demand weights.
Networks, 2022
Introducing Autonomous Vehicles: Adoption Patterns and Impacts on Social Welfare.
Manuf. Serv. Oper. Manag., 2022
2021
Optimizing facility location and design.
Eur. J. Oper. Res., 2021
Location problems with continuous demand and unreliable facilities: Applications of families of incremental Voronoi diagrams.
Discret. Appl. Math., 2021
2019
Tandem queues with impatient customers.
Perform. Evaluation, 2019
Truthful Cheap Talk: Why Operational Flexibility May Lead to Truthful Communication.
Manag. Sci., 2019
The multiple gradual cover location problem.
J. Oper. Res. Soc., 2019
Almost Robust Discrete Optimization.
Eur. J. Oper. Res., 2019
2018
Threshold-Based Allocation Policies for Inventory Management of Red Blood Cells.
Manuf. Serv. Oper. Manag., 2018
Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights.
Discret. Appl. Math., 2018
Location and Capacity Planning of Facilities with General Service-Time Distributions Using Conic Optimization.
CoRR, 2018
2017
Exact analysis of the (R, Q) inventory policy in a two-echelon production-inventory system.
Oper. Res. Lett., 2017
Strategic Idleness and Dynamic Scheduling in an Open-Shop Service Network: Case Study and Analysis.
Manuf. Serv. Oper. Manag., 2017
2016
Maximal Accessibility Network Design in the Public Sector.
Transp. Sci., 2016
Bargaining within the Supply Chain and Its Implications in an Industry.
Decis. Sci., 2016
On covering location problems on networks with edge demand.
Comput. Oper. Res., 2016
2015
Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand.
Oper. Res., 2015
Optimal Joint Replenishment and Transshipment Policies in a Multi-Period Inventory System with Lost Sales.
Oper. Res., 2015
2014
Designing Production-Inventory-Transportation Systems with Capacitated Cross-Docks.
Transp. Sci., 2014
Cooperative covering problems on networks.
Networks, 2014
Minisum multipurpose trip location problem on trees.
Networks, 2014
Exact Analysis of Capacitated Two-Echelon Inventory Systems with Priorities.
Manuf. Serv. Oper. Manag., 2014
Using Strategic Idleness to Improve Customer Service Experience in Service Networks.
Oper. Res., 2014
Supporting New Product or Service Introductions: Location, Marketing, and Word of Mouth.
Oper. Res., 2014
2013
Continuous covering and cooperative covering problems with a general decay function on networks.
J. Oper. Res. Soc., 2013
2012
Profit Maximizing Distributed Service System Design with Congestion and Elastic Demand.
Transp. Sci., 2012
The impact of client choice on preventive healthcare facility network design.
OR Spectr., 2012
A coordinated location-inventory model.
Eur. J. Oper. Res., 2012
Optimal response against bioterror attack on airport terminal.
Eur. J. Oper. Res., 2012
Do Shareholders Really Prefer Their Executives to Maximize the Equity Value? A Newsvendor Case.
Decis. Sci., 2012
2011
Big segment small segment global optimization algorithm on networks.
Networks, 2011
Optimizing capacity, pricing and location decisions on a congested network with balking.
Math. Methods Oper. Res., 2011
Discrete cooperative covering problems.
J. Oper. Res. Soc., 2011
The minmax regret gradual covering location problem on a network with incomplete information of demand weights.
Eur. J. Oper. Res., 2011
On n-facility median problem with facilities subject to failure facing uniform demand.
Discret. Appl. Math., 2011
The probabilistic gradual covering location problem on a network with discrete random demand weights.
Comput. Oper. Res., 2011
Optimal search path for service in the presence of disruptions.
Comput. Oper. Res., 2011
2010
Continuous review inventory models for perishable items ordered in batches.
Math. Methods Oper. Res., 2010
The network p-median problem with discrete probabilistic demand weights.
Comput. Oper. Res., 2010
Generalized coverage: New developments in covering location models.
Comput. Oper. Res., 2010
2009
A defensive maximal covering problem on a network.
Int. Trans. Oper. Res., 2009
Incorporating congestion in preventive healthcare facility network design.
Eur. J. Oper. Res., 2009
Bargaining in competing supply chains with uncertainty.
Eur. J. Oper. Res., 2009
The variable radius covering problem.
Eur. J. Oper. Res., 2009
Locating Facilities in the Presence of Disruptions and Incomplete Information.
Decis. Sci., 2009
The Ordered Gradual Covering Location Problem on a Network.
Discret. Appl. Math., 2009
Optimal location with equitable loads.
Ann. Oper. Res., 2009
Efficient solution approaches for a discrete multi-facility competitive interaction model.
Ann. Oper. Res., 2009
The multiple server center location problem.
Ann. Oper. Res., 2009
2008
A new formulation for the conditional p-median and p-center problems.
Oper. Res. Lett., 2008
Facility Location with Stochastic Demand and Constraints on Waiting Time.
Manuf. Serv. Oper. Manag., 2008
The probabilistic 1-maximal covering problem on a network with discrete demand weights.
J. Oper. Res. Soc., 2008
The multiple location of transfer points.
J. Oper. Res. Soc., 2008
Optimizing pricing and location decisions for competitive service facilities charging uniform price.
J. Oper. Res. Soc., 2008
The p-median problem under uncertainty.
Eur. J. Oper. Res., 2008
Locating a semi-obnoxious facility with expropriation.
Comput. Oper. Res., 2008
The minimum weighted covering location problem with distance constraints.
Comput. Oper. Res., 2008
2007
The Minisum Multipurpose Trip Location Problem on Networks.
Transp. Sci., 2007
The 1-minimax and 1-maximin problems with demand weights of general probability distributions.
Networks, 2007
Locating semi-obnoxious facilities with expropriation: minisum criterion.
J. Oper. Res. Soc., 2007
The multiple server location problem.
J. Oper. Res. Soc., 2007
Reply to Özpeynirci and Süral.
J. Oper. Res. Soc., 2007
Facility Reliability Issues in Network <i>p</i>-Median Problems: Strategic Centralization and Co-Location Effects.
Oper. Res., 2007
Location of terror response facilities: A game between state and terrorist.
Eur. J. Oper. Res., 2007
The transfer point location problem.
Eur. J. Oper. Res., 2007
Balancing staffing and switching costs in a service center with flexible servers.
Eur. J. Oper. Res., 2007
The equitable location problem on the plane.
Eur. J. Oper. Res., 2007
The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation.
Eur. J. Oper. Res., 2007
Competitive facility location and design problem.
Eur. J. Oper. Res., 2007
Competitive facility location model with concave demand.
Eur. J. Oper. Res., 2007
Designing emergency response networks for hazardous materials transportation.
Comput. Oper. Res., 2007
2006
Inbound Logistic Planning: Minimizing Transportation and Inventory Cost.
Transp. Sci., 2006
An EOQ model with state-dependent demand rate.
Eur. J. Oper. Res., 2006
The routing open-shop problem on a network: Complexity and approximation.
Eur. J. Oper. Res., 2006
2005
Approximating performance measures for public services.
IEEE Trans. Syst. Man Cybern. Part A, 2005
The <i>m</i>-machine flowshop problem with unit-time operations and intree precedence constraints.
Oper. Res. Lett., 2005
The facility and transfer points location problem.
Int. Trans. Oper. Res., 2005
Optimal management of cross-trained workers in services with negligible switching costs.
Eur. J. Oper. Res., 2005
A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network.
Eur. J. Oper. Res., 2005
An Improved IP Formulation for the Uncapacitated Facility Location Problem: Capitalizing on Objective Function Structure.
Ann. Oper. Res., 2005
2004
Probabilistic location problems with discrete demand weights.
Networks, 2004
Dynamic inventory strategies for profit maximization in a service facility with stochastic service, demand and lead time.
Math. Methods Oper. Res., 2004
Minisum collection depots location problem with multiple facilities on a network.
J. Oper. Res. Soc., 2004
A queueing control model for retail services having back room operations and cross-trained workers.
Comput. Oper. Res., 2004
Resource allocation during tests for optimally reliable software.
Comput. Oper. Res., 2004
2003
An improved algorithm for the minmax regret median problem on a tree.
Networks, 2003
A transfer/clearing inventory model under sporadic review.
Math. Methods Oper. Res., 2003
The expropriation location problem.
J. Oper. Res. Soc., 2003
A probabilistic one-centre location problem on a network.
J. Oper. Res. Soc., 2003
The gradual covering decay location problem on a network.
Eur. J. Oper. Res., 2003
Locating service facilities whose reliability is distance dependent.
Comput. Oper. Res., 2003
A Probabilistic Minimax Location Problem on the Plane.
Ann. Oper. Res., 2003
2002
Parallel NC-algorithms for multifacility location problems with mutual communication and their applications.
Networks, 2002
The generalized maximal covering location problem.
Comput. Oper. Res., 2002
Locating Multiple Competitive Facilities: Spatial Interaction Models with Variable Expenditures.
Ann. Oper. Res., 2002
Recent Developments in the Theory and Applications of Location Models: A Preview.
Ann. Oper. Res., 2002
Minmax <i>p</i>-Traveling Salesmen Location Problems on a Tree.
Ann. Oper. Res., 2002
2001
A decision model and support system for the optimal design of health information networks.
IEEE Trans. Syst. Man Cybern. Syst., 2001
Deliveries in an Inventory/Routing Problem Using Stochastic Dynamic Programming.
Transp. Sci., 2001
Dynamic order replenishment policy in internet-based supply chains.
Math. Methods Oper. Res., 2001
Optimal control of service for facilities holding inventory.
Comput. Oper. Res., 2001
2000
Routing and location on a network with hazardous threats.
J. Oper. Res. Soc., 2000
Minmax Regret Median Location on a Network Under Uncertainty.
INFORMS J. Comput., 2000
A note on the location of an obnoxious facility on a network.
Eur. J. Oper. Res., 2000
Algorithms for the robust 1-center problem on a tree.
Eur. J. Oper. Res., 2000
1999
A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems.
Oper. Res., 1999
Parallel Complexity of Additive Location Problems.
INFORMS J. Comput., 1999
Optimization models for recovery block schemes.
Eur. J. Oper. Res., 1999
Optimization models for complex recovery block schemes.
Comput. Oper. Res., 1999
Algorithms for path medi-centers of a tree.
Comput. Oper. Res., 1999
1998
Location problems with grouped structure of demand: Complexity and algorithms.
Networks, 1998
The plant location problem with demand-dependent setup costs and centralized allocation.
Eur. J. Oper. Res., 1998
Optimal software implementation considering reliability and cost.
Comput. Oper. Res., 1998
1997
(p - 1)/(p + 1)-approximate Algorithms for P-traveling Salesmen Problems on a Tree with Minmax Objective.
Discret. Appl. Math., 1997
1996
Routing Two-Machine Flowshop Problems on Networks with Special Structure.
Transp. Sci., 1996
Technical Note - A Sequential Location Scheme for the Distance-Constrained Multifacility Location Problem on a Tree.
Transp. Sci., 1996
Choosing an optimal set of libraries [software reliability].
IEEE Trans. Reliab., 1996
Minimum covering criterion for obnoxious facility location on a network.
Networks, 1996
Bottleneck Steiner Subnetwork Problems with <i>k</i>-Connectivity Constraints.
INFORMS J. Comput., 1996
A Heuristic with Worst-case Analysis for Minimax Routing of Two Travelling Salesmen on a Tree.
Discret. Appl. Math., 1996
1995
Locating Discretionary Service Facilities Based on Probabilistic Customer Flows.
Transp. Sci., 1995
Probabilistic Sales-Delivery Man and Sales-Delivery Facility Location Problems on a Tree.
Transp. Sci., 1995
Sales-delivery man problems on treelike networks.
Networks, 1995
Locating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience.
Oper. Res., 1995
Constrained Matroidal Bottleneck Problems.
Discret. Appl. Math., 1995
Models for planning capacity expansion of convenience stores under uncertain demand and the value of information.
Ann. Oper. Res., 1995
Locating flow-intercepting facilities: New approaches and results.
Ann. Oper. Res., 1995
1994
Technical Note - Routing and Location-Routing p-Delivery Men Problems on a Path.
Transp. Sci., 1994
Categorized bottleneck-minisum path problems on networks.
Oper. Res. Lett., 1994
Improving the location of minimax facilities through network modification.
Networks, 1994
1993
Optimization Models for Reliability of Modular Software Systems.
IEEE Trans. Software Eng., 1993
1992
Optimal Location of Discretionary Service Facilities.
Transp. Sci., 1992
Improving the location of minisum facilities through network modification.
Ann. Oper. Res., 1992
1990
Information/communication and dispatching strategies for networks with mobile servers.
IEEE Trans. Syst. Man Cybern., 1990
Technical Note - Conditional Location Problems on Networks.
Transp. Sci., 1990
Equity Maximizing Facility Location Schemes.
Transp. Sci., 1990
Mean-Variance Location Problems.
Transp. Sci., 1990
Optimal locations and districts of two traveling salesmen on a tree.
Networks, 1990
The Constrained Bottleneck Problem in Networks.
Oper. Res., 1990
1989
The Traveling Salesman Location Problem on Stochastic Networks.
Transp. Sci., 1989
A location model for a facility operating as an <i>M/G/k</i> queue.
Networks, 1989
1988
Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers.
Transp. Sci., 1988
The minimax multistop location problem on a tree.
Networks, 1988
A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks.
Oper. Res., 1988
1987
The Stochastic Queue <i>p</i>-Median Problem.
Transp. Sci., 1987
Optimal Minimax Path of a Single Service Unit on a Network to Nonservice Destinations.
Transp. Sci., 1987
1986
Cooperation among flexible manufacturing systems.
IEEE J. Robotics Autom., 1986
Minisum location of a traveling salesman.
Networks, 1986
1985
Optimal Location-Relocation Decisions on Stochastic Networks.
Transp. Sci., 1985
Optimal 2-Facility Network Districting in the Presence of Queuing.
Transp. Sci., 1985
Locating a facility on a congested network with random lengths.
Networks, 1985
Optimal Server Location on a Network Operating as an <i>M</i>/<i>G</i>/1 Queue.
Oper. Res., 1985
The value of an information system for service networks.
Comput. Oper. Res., 1985
1984
Location-Relocation of Mobile Facilities on a Stochastic Network.
Transp. Sci., 1984
1983
A procedure for dispatching moving mobile servers.
Networks, 1983
1982
Locating mobile servers on a network with markovian properties.
Networks, 1982
The median problem with congestion.
Comput. Oper. Res., 1982
1981
Repositioning of Two Distinguishable Service Vehicles on Networks.
IEEE Trans. Syst. Man Cybern., 1981
Repositioning of distinguishable urban service units on networks.
Comput. Oper. Res., 1981