David Simchi-Levi

Manag. Sci., 2024

The Power of Adaptivity in Experimental Design.

[BibT_eX]

[DOI]

Yunxiao Zhao

CoRR, 2024

Experimenting on Markov Decision Processes with Local Treatments.

[BibT_eX]

[DOI]

Shuze Chen

CoRR, 2024

Offline Oracle-Efficient Learning for Contextual MDPs via Layerwise Exploration-Exploitation Tradeoff.

[BibT_eX]

[DOI]

Jian Qian

Haichen Hu

CoRR, 2024

On the Optimal Regret of Locally Private Linear Contextual Bandit.

[BibT_eX]

[DOI]

CoRR, 2024

Online Local False Discovery Rate Control: A Resource Allocation Approach.

[BibT_eX]

[DOI]

CoRR, 2024

Differentially Private Estimation of CATE in Adaptive Experiment.

[BibT_eX]

[DOI]

Kaining Shi

CoRR, 2024

Privacy Preserving Adaptive Experiment Design.

[BibT_eX]

[DOI]

Kaining Shi

Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023

Phase Transitions in Bandits with Switching Constraints.

[BibT_eX]

[DOI]

Manag. Sci., December, 2023

2023 MSOM Society Best AE Award: Management Science.

[BibT_eX]

[DOI]

Manag. Sci., December, 2023

From the Editor: Reflections on the Last Six Years as Editor-in-Chief of Management Science.

[BibT_eX]

[DOI]

Manag. Sci., December, 2023

Nonstationary Reinforcement Learning: The Blessing of (More) Optimism.

[BibT_eX]

[DOI]

Manag. Sci., October, 2023

Estimating and Exploiting the Impact of Photo Layout: A Structural Approach.

[BibT_eX]

[DOI]

Manag. Sci., September, 2023

Design and Analysis of Switchback Experiments.

[BibT_eX]

[DOI]

Iavor Bojinov

Manag. Sci., July, 2023

Offline Pricing and Demand Learning with Censored Data.

[BibT_eX]

[DOI]

Jinzhi Bu

Li Wang

Manag. Sci., February, 2023

From the Editor - January 2023.

[BibT_eX]

[DOI]

Manag. Sci., January, 2023

Utility Fairness in Contextual Dynamic Pricing with Demand Learning.

[BibT_eX]

[DOI]

Xi Chen

CoRR, 2023

Regret Distribution in Stochastic Bandits: Optimal Trade-off between Expectation and Tail Risk.

[BibT_eX]

[DOI]

CoRR, 2023

Stochastic Multi-armed Bandits: Optimal Trade-off among Optimality, Consistency, and Tail Risk.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Non-stationary Experimental Design under Linear Trends.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Pricing Experimental Design: Causal Effect, Expected Revenue and Tail Risk.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

Multi-armed Bandit Experimental Design: Online Decision-making and Adaptive Inference.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022

Online Pricing with Offline Data: Phase Transition and Inverse Square Law.

[BibT_eX]

[DOI]

Jinzhi Bu

Manag. Sci., December, 2022

Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability.

[BibT_eX]

[DOI]

Math. Oper. Res., 2022

Online Learning and Optimization for Revenue Management Problems with Add-on Discounts.

[BibT_eX]

[DOI]

Rui Sun

Huanan Zhang

Manag. Sci., 2022

Data-Driven Approximation Schemes for Joint Pricing and Inventory Control Models.

[BibT_eX]

[DOI]

Hanzhang Qin

Li Wang

Manag. Sci., 2022

Online Assortment Optimization with Reusable Resources.

[BibT_eX]

[DOI]

Manag. Sci., 2022

Hedging the Drift: Learning to Optimize Under Nonstationarity.

[BibT_eX]

[DOI]

Manag. Sci., 2022

Inventory Balancing with Online Learning.

[BibT_eX]

[DOI]

Manag. Sci., 2022

Dynamic Pricing and Inventory Control with Fixed Ordering Cost and Incomplete Demand Information.

[BibT_eX]

[DOI]

Manag. Sci., 2022

Privacy-Preserving Dynamic Personalized Pricing with Demand Learning.

[BibT_eX]

[DOI]

Xi Chen

Manag. Sci., 2022

A Statistical Learning Approach to Personalization in Revenue Management.

[BibT_eX]

[DOI]

Manag. Sci., 2022

Meta Dynamic Pricing: Transfer Learning Across Experiments.

[BibT_eX]

[DOI]

Hamsa Bastani

Manag. Sci., 2022

A New Approach for Vehicle Routing with Stochastic Demand: Combining Route Assignment with Process Flexibility.

[BibT_eX]

[DOI]

Oper. Res., 2022

Distributionally Robust Linear and Discrete Optimization with Marginals.

[BibT_eX]

[DOI]

Oper. Res., 2022

Constructing Demand Curves from a Single Observation of Bundle Sales.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 18th International Conference, 2022

A Simple and Optimal Policy Design for Online Learning with Safety against Heavy-tailed Risk.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Learning Mixed Multinomial Logits with Provable Guarantees.

[BibT_eX]

[DOI]

Yiqun Hu

Zhenzhen Yan

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Context-Based Dynamic Pricing with Partially Linear Demand Model.

[BibT_eX]

[DOI]

Jinzhi Bu

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Offline Reinforcement Learning: Fundamental Barriers for Value Function Approximation.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Sobolev Norm Learning Rates for Conditional Mean Embeddings.

[BibT_eX]

[DOI]

Prem Talwai

Ali Shameli

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021

Multimodal Dynamic Pricing.

[BibT_eX]

[DOI]

Boxiao Chen

Manag. Sci., 2021

Introduction to the Special Section: Management Science's 65th Anniversary.

[BibT_eX]

[DOI]

Manag. Sci., 2021

Dynamic Pricing (and Assortment) Under a Static Calendar.

[BibT_eX]

[DOI]

Manag. Sci., 2021

Shrinking the Upper Confidence Bound: A Dynamic Product Selection Problem for Urban Warehouses.

[BibT_eX]

[DOI]

Manag. Sci., 2021

Management Science: The Legacy of the Past and Challenge of the Future.

[BibT_eX]

[DOI]

Wallace J. Hopp

Manag. Sci., 2021

On Policies for Single-Leg Revenue Management with Limited Demand Information.

[BibT_eX]

[DOI]

Chung-Piaw Teo

Oper. Res., 2021

Dynamic Pricing and Demand Learning on a Large Network of Products: A PAC-Bayesian Approach.

[BibT_eX]

[DOI]

Bora Keskin

Prem Talwai

CoRR, 2021

Dynamic Planning and Learning under Recovering Rewards.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

Near-Optimal Model-Free Reinforcement Learning in Non-Stationary Episodic MDPs.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

Instance-Dependent Complexity of Contextual Bandits and Reinforcement Learning: A Disagreement-Based Perspective.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2021

Reaping the Benefits of Bundling under High Production Costs.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020

From the Editor: Diversity, Equity, and Inclusion in Management Science.

[BibT_eX]

[DOI]

Manag. Sci., 2020

From the Editor.

[BibT_eX]

[DOI]

Manag. Sci., 2020

Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios.

[BibT_eX]

[DOI]

Oper. Res., 2020

Near-Optimal Regret Bounds for Model-Free RL in Non-Stationary Episodic MDPs.

[BibT_eX]

[DOI]

CoRR, 2020

Provably More Efficient Q-Learning in the Full-Feedback/One-Sided-Feedback Settings.

[BibT_eX]

[DOI]

Xiao-Yue Gong

CoRR, 2020

Distributionally Robust Max Flows.

[BibT_eX]

[DOI]

Proceedings of the 3rd Symposium on Simplicity in Algorithms, 2020

Reinforcement Learning for Non-Stationary Markov Decision Processes: The Blessing of (More) Optimism.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

2019

Constraint Generation for Two-Stage Robust Network Flow Problems.

[BibT_eX]

[DOI]

INFORMS J. Optim., January, 2019

Sampling-Based Approximation Schemes for Capacitated Stochastic Inventory Control Models.

[BibT_eX]

[DOI]

Math. Oper. Res., 2019

Dynamic Learning and Pricing with Model Misspecification.

[BibT_eX]

[DOI]

Mila Nambiar

Manag. Sci., 2019

Drivers of Product Expiration in Consumer Packaged Goods Retailing.

[BibT_eX]

[DOI]

Arzum Akkas

Vishal Gaur

Manag. Sci., 2019

Designing Response Supply Chain Against Bioattacks.

[BibT_eX]

[DOI]

Nikolaos Trichakis

Peter Yun Zhang

Oper. Res., 2019

Disruption Risk Mitigation in Supply Chains: The Risk Exposure Index Revisited.

[BibT_eX]

[DOI]

Oper. Res., 2019

Network Revenue Management with Limited Switches: Known and Unknown Demand Distributions.

[BibT_eX]

[DOI]

CoRR, 2019

Multi-stage and Multi-customer Assortment Optimization with Inventory Constraints.

[BibT_eX]

[DOI]

Elaheh Fata

CoRR, 2019

A Competitive Analysis of Online Knapsack Problems with Unit Density.

[BibT_eX]

[DOI]

CoRR, 2019

Reinforcement Learning under Drift.

[BibT_eX]

[DOI]

CoRR, 2019

Conservative Exploration for Semi-Bandits with Linear Generalization: A Product Selection Problem for Urban Warehouses.

[BibT_eX]

[DOI]

CoRR, 2019

Hedging the Drift: Learning to Optimize under Non-Stationarity.

[BibT_eX]

[DOI]

CoRR, 2019

Meta Dynamic Pricing: Learning Across Experiments.

[BibT_eX]

[DOI]

Hamsa Bastani

CoRR, 2019

Phase Transitions and Cyclic Phenomena in Bandits with Switching Constraints.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Tight Weight-dependent Competitive Ratios for Online Edge-weighted Bipartite Matching and Beyond.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

Learning to Optimize under Non-Stationarity.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018

Reengineering Management Science for a Sharper Focus and Broader Appeal.

[BibT_eX]

[DOI]

Manag. Sci., 2018

Online Network Revenue Management Using Thompson Sampling.

[BibT_eX]

[DOI]

Kris Johnson Ferreira

Oper. Res., 2018

Powering retailers' digitization through analytics and automation.

[BibT_eX]

[DOI]

Michelle Xiao Wu

Int. J. Prod. Res., 2018

Dynamic Pricing under a Static Calendar.

[BibT_eX]

[DOI]

CoRR, 2018

The Lingering of Gradients: How to Reuse Gradients Over Time.

[BibT_eX]

[DOI]

Zeyuan Allen-Zhu

Xinshang Wang

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017

Editorial Statement - Operations Management.

[BibT_eX]

[DOI]

Manag. Sci., 2017

Technical Note - Dynamic Pricing and Demand Learning with Limited Price Experimentation.

[BibT_eX]

[DOI]

Oper. Res., 2017

Assortment Optimization under Unknown MultiNomial Logit Choice Models.

[BibT_eX]

[DOI]

CoRR, 2017

Uplift Modeling with Multiple Treatments and General Response Types.

[BibT_eX]

[DOI]

Yan Zhao

Xiao Fang

Proceedings of the 2017 SIAM International Conference on Data Mining, 2017

A Practically Competitive and Provably Consistent Algorithm for Uplift Modeling.

[BibT_eX]

[DOI]

Yan Zhao

Xiao Fang

Proceedings of the 2017 IEEE International Conference on Data Mining, 2017

2016

Analyzing process flexibility: A distribution-free approach with partial expectations.

[BibT_eX]

[DOI]

Hoda Bidkhori

Oper. Res. Lett., 2016

Analytics for an Online Retailer: Demand Forecasting and Price Optimization.

[BibT_eX]

[DOI]

Kris Johnson Ferreira

Bin Hong Alex Lee

Manuf. Serv. Oper. Manag., 2016

2015

Worst-Case Analysis of Process Flexibility Designs.

[BibT_eX]

[DOI]

Oper. Res., 2015

Identifying Risks and Mitigating Disruptions in the Automotive Supply Chain.

[BibT_eX]

[DOI]

Interfaces, 2015

2014

Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

OM Forum - OM Research: From Problem-Driven to Data-Driven Research.

[BibT_eX]

[DOI]

Manuf. Serv. Oper. Manag., 2014

Analyzing Scrip Systems.

[BibT_eX]

[DOI]

Kris Johnson

Peng Sun

Oper. Res., 2014

2013

A Game-Theoretic Model of International Influenza Vaccination Coordination.

[BibT_eX]

[DOI]

Hamed Mamani

Stephen E. Chick

Manag. Sci., 2013

2012

Understanding the Performance of the Long Chain and Sparse Designs in Process Flexibility.

[BibT_eX]

[DOI]

Oper. Res., 2012

Optimal Market-Making with Risk Aversion.

[BibT_eX]

[DOI]

Kan Huang

Miao Song

Oper. Res., 2012

Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle.

[BibT_eX]

[DOI]

Nir Halman

James B. Orlin

Oper. Res., 2012

Optimal static pricing for a tree network.

[BibT_eX]

[DOI]

Felipe Caro

Ann. Oper. Res., 2012

Performance Evaluation of Stochastic Multi-Echelon Inventory Systems: A Survey.

[BibT_eX]

[DOI]

Adv. Oper. Res., 2012

2011

Stock repurchase with an adaptive reservation price: A study of the greedy policy.

[BibT_eX]

[DOI]

Ye Lu

Asuman E. Ozdaglar

Oper. Res. Lett., 2011

Introduction to "Little's Law as Viewed on Its 50th Anniversary".

[BibT_eX]

[DOI]

Michael A. Trick

Oper. Res., 2011

From the Editor: Reflections on the Last Six Years.

[BibT_eX]

[DOI]

Oper. Res., 2011

Sourcing Flexibility, Spot Trading, and Procurement Contract Structure.

[BibT_eX]

[DOI]

Pamela Pen-Erh Pei

Tunay I. Tunca

Oper. Res., 2011

2010

Multiship Crane Sequencing with Yard Congestion Constraints.

[BibT_eX]

[DOI]

Shawn Choo

Diego Klabjan

Transp. Sci., 2010

2009

Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks.

[BibT_eX]

[DOI]

Nir Halman

Víctor Martínez-de-Albéniz

Oper. Res. Lett., 2009

A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand.

[BibT_eX]

[DOI]

Math. Oper. Res., 2009

Competition in the Supply Option Market.

[BibT_eX]

[DOI]

Oper. Res., 2009

2008

Policies utilizing tactical inventory for service-differentiated customers.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2008

Supply Chain Coordination and Influenza Vaccination.

[BibT_eX]

[DOI]

Stephen E. Chick

Hamed Mamani

Oper. Res., 2008

2007

Risk Aversion in Inventory Management.

[BibT_eX]

[DOI]

Oper. Res., 2007

2006

Inventory placement in acyclic supply chain networks.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2006

Coordinating inventory control and pricing strategies: The continuous review model.

[BibT_eX]

[DOI]

Xin Chen

Oper. Res. Lett., 2006

Pricing, Production, and Inventory Policies for Manufacturing with Stochastic Demand and Discretionary Sales.

[BibT_eX]

[DOI]

Julie L. Swann

Manuf. Serv. Oper. Manag., 2006

The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates.

[BibT_eX]

[DOI]

Mabel C. Chou

Maurice Queyranne

Math. Program., 2006

Performance Analysis and Evaluation of Assemble-to-Order Systems with Stochastic Sequential Lead Times.

[BibT_eX]

[DOI]

Oper. Res., 2006

On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions.

[BibT_eX]

[DOI]

Oper. Res., 2006

2005

Dispatching vehicles in a mega container terminal.

[BibT_eX]

[DOI]

Jonathan Wing Cheong Ng

OR Spectr., 2005

Safety Stock Positioning in Supply Chains with Stochastic Lead Times.

[BibT_eX]

[DOI]

Manuf. Serv. Oper. Manag., 2005

Dynamic Pricing and the Direct-to-Customer Model in the Automotive Industry.

[BibT_eX]

[DOI]

Electron. Commer. Res., 2005

2004

A General Decomposition Algorithm for Parallel Queues with Correlated Arrivals.

[BibT_eX]

[DOI]

Seyed M. R. Iravani

K. Louis Luangkesorn

Queueing Syst. Theory Appl., 2004

Coordinating Inventory Control and Pricing Strategies with Random Demand and Fixed Ordering Cost: The Infinite Horizon Case.

[BibT_eX]

[DOI]

Xin Chen

Math. Oper. Res., 2004

Coordinating Inventory Control and Pricing Strategies with Random Demand and Fixed Ordering Cost: The Finite Horizon Case.

[BibT_eX]

[DOI]

Xin Chen

Oper. Res., 2004

2003

Networks and Flows.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Graph Theory., 2003

Supply Chain Design and Planning - Applications of Optimization Techniques for Strategic and Tactical Models.

[BibT_eX]

[DOI]

Ana Muriel

Proceedings of the Supply Chain Management: Design, Coordination and Operation, 2003

2002

The Value of Information Sharing in a Two-Stage Supply Chain with Production Capacity Constraints: The Infinite Horizon Case.

[BibT_eX]

[DOI]

Manuf. Serv. Oper. Manag., 2002

Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures.

[BibT_eX]

[DOI]

Manag. Sci., 2002

On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures.

[BibT_eX]

[DOI]

Oper. Res., 2002

Uniform distribution of inventory positions in two-echelon periodic review systems with batch-ordering policies and interdependent demands.

[BibT_eX]

[DOI]

Frank Y. Chen

Youyi Feng

Eur. J. Oper. Res., 2002

Set-Covering-Based Algorithms for the Capacitated VRP.

[BibT_eX]

[DOI]

Proceedings of the Vehicle Routing Problem., 2002

2001

Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates.

[BibT_eX]

[DOI]

Philip M. Kaminsky

Oper. Res. Lett., 2001

The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem.

[BibT_eX]

[DOI]

Philip M. Kaminsky

Michael Mesterton-Gibbons

Oper. Res., 2001

1999

Networks And Flows.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

Discrete Optimization.

[BibT_eX]

[DOI]

Joseph R. Barr

Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

1998

Worst-case analyses, linear programming and the bin-packing problem.

[BibT_eX]

[DOI]

Math. Program., 1998

Probabilistic Analysis and Practical Algorithms for the Flow Shop Weighted Completion Time Problem.

[BibT_eX]

[DOI]

Philip M. Kaminsky

Oper. Res., 1998

Parallel Machine Scheduling, Linear Programming, and Parameter List Scheduling Heuristics.

[BibT_eX]

[DOI]

Ana Muriel

Oper. Res., 1998

Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models.

[BibT_eX]

[DOI]

Awi Federgruen

Oper. Res., 1998

1997

On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows.

[BibT_eX]

[DOI]

Oper. Res., 1997

1996

Single Resource Multi-Item Inventory Systems.

[BibT_eX]

[DOI]

Guillermo Gallego

Maurice Queyranne

Oper. Res., 1996

Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows.

[BibT_eX]

[DOI]

Oper. Res., 1996

A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty.

[BibT_eX]

[DOI]

Dimitris J. Bertsimas

Oper. Res., 1996

1995

Routing in a linear lightwave network.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 1995

A Location Based Heuristic for General Routing Problems.

[BibT_eX]

[DOI]

Oper. Res., 1995

1994

Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures.

[BibT_eX]

[DOI]

Shoshana Anily

Oper. Res., 1994

1993

A note on the prize collecting traveling salesman problem.

[BibT_eX]

[DOI]

Math. Program., 1993

A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands.

[BibT_eX]

[DOI]

Daniel Bienstock

Math. Oper. Res., 1993

1992

On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1992

The complexity of the staggering problem, and other classical inventory problems.

[BibT_eX]

[DOI]

Guillermo Gallego

Dong Shaw

Oper. Res. Lett., 1992

Finding disjoint paths with different path-costs: Complexity and algorithms.

[BibT_eX]

[DOI]

Networks, 1992

On the Distance Constrained Vehicle Routing Problem.

[BibT_eX]

[DOI]

Martin Desrochers

Oper. Res., 1992

Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands.

[BibT_eX]

[DOI]

Edward G. Coffman Jr.

Peter W. Shor

Oper. Res., 1992

The point-to-point delivery and connection problems: complexity and algorithms.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

Light traffic heuristic for anM/G/1 queue with limited inventory.

[BibT_eX]

[DOI]

Karl Sigman

Ann. Oper. Res., 1992

Analysis of heuristics for the design of tree networks.

[BibT_eX]

[DOI]

Bezalel Gavish

Ann. Oper. Res., 1992

Asymptotic behavior of the Weber location problem on the plane.

[BibT_eX]

[DOI]

Zvi Drezner

Ann. Oper. Res., 1992

1991

The Capacitated Traveling Salesman Location Problem.

[BibT_eX]

[DOI]

Transp. Sci., 1991

1990

Technical Note - Conditional Location Problems on Networks.

[BibT_eX]

[DOI]

Transp. Sci., 1990

Optimal locations and districts of two traveling salesmen on a tree.

[BibT_eX]

[DOI]

Networks, 1990

Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems.

[BibT_eX]

[DOI]

INFORMS J. Comput., 1990

The complexity of finding two disjoint paths with min-max objective function.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1990

1989

The Traveling Salesman Location Problem on Stochastic Networks.

[BibT_eX]

[DOI]

Transp. Sci., 1989

1988

Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers.

[BibT_eX]

[DOI]

Transp. Sci., 1988

The minimax multistop location problem on a tree.

[BibT_eX]

[DOI]

Arie Tamir

Networks, 1988

A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks.

[BibT_eX]

[DOI]

Oper. Res., 1988

1986

Minisum location of a traveling salesman.

[BibT_eX]

[DOI]