default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarshall L. Fisher
Person information
- affiliation: University of Pennsylvania, The Wharton School, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j40]Youran Fu, Marshall L. Fisher
:
The Value of Social Media Data in Fashion Forecasting. Manuf. Serv. Oper. Manag. 25(3): 1136-1154 (2023)- 2021
- [j39]Marshall L. Fisher, Santiago Gallino, Serguei Netessine:
Does Online Training Work in Retail? Manuf. Serv. Oper. Manag. 23(4): 876-894 (2021) - [j38]Marshall L. Fisher, Santiago Gallino, Serguei Netessine:
Setting Retail Staffing Levels: A Methodology Validated with Implementation. Manuf. Serv. Oper. Manag. 23(6): 1562-1579 (2021) - 2020
- [j37]Marshall L. Fisher, Marcelo Olivares, Bradley R. Staats:
Why Empirical Research Is Good for Operations Management, and What Is Good Empirical Operations Management? Manuf. Serv. Oper. Manag. 22(1): 170-178 (2020)
2010 – 2019
- 2019
- [j36]Chloe Kim Glaeser, Marshall L. Fisher, Xuanming Su:
Optimal Retail Location: Empirical Methodology and Application to Practice. Manuf. Serv. Oper. Manag. 21(1): 86-102 (2019) - 2018
- [j35]Marshall L. Fisher, Santiago Gallino, Jun Li:
Competition-Based Dynamic Pricing in Online Retailing: A Methodology Validated with Field Experiments. Manag. Sci. 64(6): 2496-2514 (2018) - 2014
- [j34]Marshall L. Fisher, Ramnath Vaidyanathan:
A Demand Estimation Procedure for Retail Assortment Optimization with Results from Implementations. Manag. Sci. 60(10): 2401-2415 (2014) - 2010
- [j33]Tom Van Woensel, Marshall L. Fisher, Jan C. Fransoo:
Teaching Retail Operations in Business and Engineering Schools. INFORMS Trans. Educ. 11(1): 29-34 (2010)
2000 – 2009
- 2009
- [j32]Marshall L. Fisher:
OR FORUM-Rocket Science Retailing: The 2006 Philip McCord Morse Lecture. Oper. Res. 57(3): 527-540 (2009) - 2007
- [j31]A. Gürhan Kök, Marshall L. Fisher:
Demand Estimation and Assortment Optimization Under Substitution: Methodology and Application. Oper. Res. 55(6): 1001-1021 (2007) - [j30]Marshall L. Fisher:
Strengthening the Empirical Base of Operations Management. Manuf. Serv. Oper. Manag. 9(4): 368-382 (2007) - [j29]Vishal Gaur, Saravanan Kesavan, Ananth Raman, Marshall L. Fisher:
Estimating Demand Uncertainty Using Judgmental Forecasts. Manuf. Serv. Oper. Manag. 9(4): 480-491 (2007) - 2005
- [j28]Vishal Gaur, Marshall L. Fisher, Ananth Raman:
An Econometric Analysis of Inventory Turnover Performance in Retail Services. Manag. Sci. 51(2): 181-194 (2005) - 2004
- [j27]Vishal Gaur, Marshall L. Fisher:
A Periodic Inventory Routing Problem at a Supermarket Chain. Oper. Res. 52(6): 813-822 (2004) - [j26]Marshall L. Fisher:
The Lagrangian Relaxation Method for Solving Integer Programming Problems. Manag. Sci. 50(12-Supplement): 1861-1871 (2004) - [j25]Marshall L. Fisher:
Comments on "The Lagrangian Relaxation Method for Solving Integer Programming Problems". Manag. Sci. 50(12-Supplement): 1872-1874 (2004) - 2003
- [j24]Kamalini Ramdas, Marshall L. Fisher, Karl Ulrich:
Managing Variety for Assembled Products: Modeling Component Systems Sharing. Manuf. Serv. Oper. Manag. 5(2): 142-156 (2003) - 2001
- [j23]Marshall L. Fisher, Kamalini Ramdas, Yu-Sheng Zheng:
Ending Inventory Valuation in Multiperiod Production Scheduling. Manag. Sci. 47(5): 679-692 (2001) - [j22]Marshall L. Fisher, Ananth Raman:
Introduction to Focused Issue: Retail Operations Management. Manuf. Serv. Oper. Manag. 3(3): 189-190 (2001) - [j21]Marshall L. Fisher, Kumar Rajaram, Ananth Raman:
Optimizing Inventory Replenishment of Retail Fashion Products. Manuf. Serv. Oper. Manag. 3(3): 230-241 (2001) - 2000
- [j20]Garland Brown, Marshall L. Fisher, Ned Stoll, Dave Beeksma, Mark Black, Ron Taylor, Choe Seok Yon, Aaron J. Williams, William Bryant, Bernard J. Jansen:
Using the lessons of Y2K to improve information systems architecture. Commun. ACM 43(10): 90-97 (2000)
1990 – 1999
- 1997
- [j19]Marshall L. Fisher, Kurt O. Jörnsten, Oli B. G. Madsen:
Vehicle Routing with Time Windows: Two Optimization Algorithms. Oper. Res. 45(3): 488-492 (1997) - 1996
- [j18]Marshall L. Fisher, Ananth Raman:
Reducing the Cost of Demand Uncertainty Through Accurate Response to Early Sales. Oper. Res. 44(1): 87-99 (1996) - 1995
- [j17]Marshall L. Fisher, Baoxing Tang, Zhang Zheng:
A Network Flow Based Heuristic for Bulk Pickup and Delivery Routing. Transp. Sci. 29(1): 45-55 (1995) - 1994
- [j16]Marshall L. Fisher:
Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees. Oper. Res. 42(4): 626-642 (1994) - [j15]Marshall L. Fisher:
A Polynomial Algorithm for the Degree-Constrained Minimum K-Tree Problem. Oper. Res. 42(4): 775-779 (1994)
1980 – 1989
- 1984
- [j14]Marshall L. Fisher, Abba M. Krieger:
Analysis of a linearization heuristic for single-machine scheduling to maximize profit. Math. Program. 28(2): 218-225 (1984) - 1983
- [j13]Marshall L. Fisher, B. J. Lageweg, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan:
Surrogate duality relaxation for job shop scheduling. Discret. Appl. Math. 5(1): 65-75 (1983) - [j12]M. A. H. Dempster, Marshall L. Fisher, L. Jansen, B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems. Math. Oper. Res. 8(4): 525-537 (1983) - 1981
- [j11]Michael A. H. Dempster, Marshall L. Fisher, L. Jansen, B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Analytical Evaluation of Hierarchical Planning Systems. Oper. Res. 29(4): 707-716 (1981) - [j10]Marshall L. Fisher, Ramchandran Jaikumar:
A generalized assignment heuristic for vehicle routing. Networks 11(2): 109-124 (1981) - 1980
- [j9]Marshall L. Fisher, Dorit S. Hochbaum:
Database Location in Computer Networks. J. ACM 27(4): 718-735 (1980) - [j8]Marshall L. Fisher, Dorit S. Hochbaum:
Probabilistic Analysis of the Planar k-Median Problem. Math. Oper. Res. 5(1): 27-34 (1980)
1970 – 1979
- 1979
- [j7]Marshall L. Fisher, George L. Nemhauser, Laurence A. Wolsey:
An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit. Oper. Res. 27(4): 799-809 (1979) - 1978
- [j6]Marshall L. Fisher, Ramchandran Jaikumar:
An Algorithm for the Space-Shuttle Scheduling Problem. Oper. Res. 26(1): 166-182 (1978) - [j5]George L. Nemhauser, Laurence A. Wolsey, Marshall L. Fisher:
An analysis of approximations for maximizing submodular set functions - I. Math. Program. 14(1): 265-294 (1978) - 1976
- [j4]Marshall L. Fisher:
A dual algorithm for the one-machine scheduling problem. Math. Program. 11(1): 229-251 (1976) - 1975
- [j3]David E. Bell, Marshall L. Fisher:
Improved integer programming bounds using intersections of corner polyhedra. Math. Program. 8(1): 345-368 (1975) - 1974
- [j2]Marshall L. Fisher, Floyd J. Gould:
A simplicial algorithm for the nonlinear complementarity problem. Math. Program. 6(1): 281-300 (1974) - 1973
- [j1]Marshall L. Fisher:
Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I. Oper. Res. 21(5): 1114-1127 (1973)
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-07 21:17 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:
