default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKurt M. Bretthauer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j22]Kevin Mayo
, Eric Webb, George P. Ball, Kurt M. Bretthauer:
Scheduling Smarter: Scheduling Decision Impact on Nurse-Aide Turnover. Manuf. Serv. Oper. Manag. 26(1): 182-196 (2024)- 2023
- [j21]Masoud Kamalahmadi, Kurt M. Bretthauer, Jonathan E. Helm, Alex F. Mills, Edwin C. Coe, Alisa Judy-Malcolm, Areeba Kara, Julian Pan:
Mixing It Up: Operational Impact of Hospitalist Caseload and Case-Mix. Manag. Sci. 69(1): 283-307 (2023) - 2020
- [j20]Jan Schoenfelder, Kurt M. Bretthauer, P. Daniel Wright, Edwin Coe:
Nurse scheduling with quick-response methods: Improving hospital performance, nurse workload, and patient experience. Eur. J. Oper. Res. 283(1): 390-403 (2020) - 2013
- [j19]Bradley E. Anderson, James D. Blocher, Kurt M. Bretthauer, Munirpallam A. Venkataramanan:
An efficient network-based formulation for sequence dependent setup scheduling on parallel identical machines. Math. Comput. Model. 57(3-4): 483-493 (2013) - 2011
- [j18]Stephen Mahar, Kurt M. Bretthauer, Peter A. Salzarulo:
Locating specialized service capacity in a multi-hospital network. Eur. J. Oper. Res. 212(3): 596-605 (2011) - 2010
- [j17]Kurt M. Bretthauer, Stephen Mahar, Munirpallam A. Venkataramanan:
Inventory and distribution strategies for retail/e-tail organizations. Comput. Ind. Eng. 58(1): 119-132 (2010) - [j16]P. Daniel Wright, Kurt M. Bretthauer:
Strategies for Addressing the Nursing Shortage: Coordinated Decision Making and Workforce Flexibility. Decis. Sci. 41(2): 373-401 (2010) - 2009
- [j15]Stephen Mahar, Kurt M. Bretthauer, M. A. Venkataramanan:
The value of virtual pooling in dual sales channel supply chains. Eur. J. Oper. Res. 192(2): 561-575 (2009) - [j14]Stephen Mahar, Kurt M. Bretthauer, M. A. Venkataramanan:
An algorithm for solving the multi-period online fulfillment assignment problem. Math. Comput. Model. 50(9-10): 1294-1304 (2009) - 2008
- [j13]Nezih Altay, Powell E. Robinson Jr., Kurt M. Bretthauer:
Exact and heuristic solution approaches for the mixed integer setup knapsack problem. Eur. J. Oper. Res. 190(3): 598-609 (2008) - 2007
- [j12]Elliot Bendoly, Doug Blocher, Kurt M. Bretthauer, M. A. Venkataramanan:
Service and cost benefits through clicks-and-mortar integration: Implications for the centralization/decentralization debate. Eur. J. Oper. Res. 180(1): 426-442 (2007) - 2006
- [j11]P. Daniel Wright, Kurt M. Bretthauer, Murray J. Côté:
Reexamining the Nurse Scheduling Problem: Staffing Ratios and Nursing Shortages. Decis. Sci. 37(1): 39-70 (2006) - [j10]Kurt M. Bretthauer, Munirpallam A. Venkataramanan:
Advances in business modeling and decision technologies. Math. Comput. Model. 44(1-2): 1-2 (2006) - [j9]Kurt M. Bretthauer, Bala Shetty, Siddhartha Syam, Robert J. Vokurka:
Production and inventory management under multiple resource constraints. Math. Comput. Model. 44(1-2): 85-95 (2006) - 2004
- [j8]Kurt M. Bretthauer:
Service Management. Decis. Sci. 35(3): 325-332 (2004) - 2002
- [j7]Kurt M. Bretthauer, Bala Shetty:
A pegging algorithm for the nonlinear resource allocation problem. Comput. Oper. Res. 29(5): 505-527 (2002) - [j6]Kurt M. Bretthauer, Bala Shetty:
The nonlinear knapsack problem - algorithms and applications. Eur. J. Oper. Res. 138(3): 459-472 (2002) - 1999
- [j5]Kurt M. Bretthauer, Anthony D. Ross, Bala Shetty:
Nonlinear integer programming for optimal allocation in stratified sampling. Eur. J. Oper. Res. 116(3): 667-680 (1999) - 1997
- [j4]Kurt M. Bretthauer, Bala Shetty:
Quadratic resource allocation with generalized upper bounds. Oper. Res. Lett. 20(2): 51-57 (1997) - 1995
- [j3]Kurt M. Bretthauer, Bala Shetty, Siddhartha Syam:
A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems. INFORMS J. Comput. 7(1): 109-116 (1995) - [j2]Kurt M. Bretthauer, Bala Shetty:
The Nonlinear Resource Allocation Problem. Oper. Res. 43(4): 670-683 (1995) - 1994
- [j1]Kurt M. Bretthauer, A. Victor Cabot:
A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron. Comput. Oper. Res. 21(7): 777-785 (1994)
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-04-24 23:08 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:
