Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhil Kaminsky
Person information
- affiliation: University of California, Berkeley, Department of Industrial Engineering and Operations Research, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j21]Yonatan Mintz
, Anil Aswani, Philip M. Kaminsky, Elena Flowers, Yoshimi Fukuoka:
Behavioral analytics for myopic agents. Eur. J. Oper. Res. 310(2): 793-811 (2023)- 2021
- [j20]Arman Jabbari, Philip M. Kaminsky:
Online scheduling to minimize total weighted (modified) earliness and tardiness cost. J. Sched. 24(4): 431-446 (2021) - 2020
- [j19]William G. Ferrell, Kimberly Ellis, Phil Kaminsky, Chase Rainwater:
Horizontal collaboration: opportunities for improved logistics planning. Int. J. Prod. Res. 58(14): 4267-4284 (2020) - [j18]Yonatan Mintz, Anil Aswani, Philip M. Kaminsky, Elena Flowers, Yoshimi Fukuoka:
Nonstationary Bandits with Habituation and Recovery Dynamics. Oper. Res. 68(5): 1493-1516 (2020) - [j17]Shiman Ding, Philip M. Kaminsky:
Centralized and Decentralized Warehouse Logistics Collaboration. Manuf. Serv. Oper. Manag. 22(4): 812-831 (2020) - 2019
- [j16]Anil Aswani, Philip M. Kaminsky, Yonatan Mintz, Elena Flowers, Yoshimi Fukuoka:
Behavioral modeling in weight loss interventions. Eur. J. Oper. Res. 272(3): 1058-1072 (2019) - 2018
- [j15]Philip M. Kaminsky, Stewart Liu:
A two-step gradient estimation approach for setting supply chain operating parameters. Comput. Oper. Res. 92: 98-110 (2018) - [j14]Hyun-Soo Ahn, Stefanus Jasin, Philip M. Kaminsky, Yang Wang:
Analysis of Deterministic Control and Its Improvements for an Inventory Problem with Multiproduct Batch Differentiation. Oper. Res. 66(1): 58-76 (2018) - [j13]Alper Sen, Alper Atamtürk, Philip M. Kaminsky:
Technical Note - A Conic Integer Optimization Approach to the Constrained Assortment Problem Under the Mixed Multinomial Logit Model. Oper. Res. 66(4): 994-1003 (2018) - 2016
- [j12]Hark-Chin Hwang, Hyun-Soo Ahn, Philip M. Kaminsky:
Algorithms for the two-stage production-capacitated lot-sizing problem. J. Glob. Optim. 65(4): 777-799 (2016) - 2013
- [j11]Hark-Chin Hwang, Hyun-Soo Ahn, Philip M. Kaminsky:
Basis Paths and a Polynomial Algorithm for the Multistage Production-Capacitated Lot-Sizing Problem. Oper. Res. 61(2): 469-482 (2013) - [j10]Kerem Bülbül, Philip M. Kaminsky:
A linear programming-based method for job shop scheduling. J. Sched. 16(2): 161-183 (2013) - 2011
- [j9]Xin Guo, Philip M. Kaminsky, Pascal I. Tomecek, M. Yuen:
Optimal spot market inventory strategies in the presence of cost and price risk. Math. Methods Oper. Res. 73(1): 109-137 (2011) - 2009
- [j8]Hyun-Soo Ahn, Mehmet Gümüs, Philip M. Kaminsky:
Inventory, Discounts, and the Timing Effect. Manuf. Serv. Oper. Manag. 11(4): 613-629 (2009) - 2008
- [j7]Philip M. Kaminsky, Zu-Hsu Lee:
Effective on-line algorithms for reliable due date quotation and large-scale scheduling. J. Sched. 11(3): 187-204 (2008) - 2007
- [j6]Hyun-Soo Ahn, Mehmet Gümüs, Philip M. Kaminsky:
Pricing and Manufacturing Decisions When Demand Is a Function of Prices in Multiple Periods. Oper. Res. 55(6): 1039-1057 (2007) - 2004
- [j5]Philip M. Kaminsky, Jayashankar M. Swaminathan:
Effective Heuristics for Capacitated Production Planning with Multiperiod Production and Demand with Forecast Band Refinement. Manuf. Serv. Oper. Manag. 6(2): 184-194 (2004) - 2001
- [j4]Philip M. Kaminsky, David Simchi-Levi:
The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem. Oper. Res. 49(2): 293-304 (2001) - [j3]Philip M. Kaminsky, Jayashankar M. Swaminathan:
Utilizing Forecast Band Refinement for Capacitated Production Planning. Manuf. Serv. Oper. Manag. 3(1): 68-81 (2001) - [j2]Philip M. Kaminsky, David Simchi-Levi:
Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates. Oper. Res. Lett. 29(3): 141-148 (2001) - 1998
- [j1]Philip M. Kaminsky, David Simchi-Levi:
Probabilistic Analysis and Practical Algorithms for the Flow Shop Weighted Completion Time Problem. Oper. Res. 46(6): 872-882 (1998)
Conference and Workshop Papers
- 2023
- [c2]Rudolf Ernst, Tsietsi Moremi, Jacomine Grobler, Philip M. Kaminsky:
A Framework for the Analysis of Metaheuristics for the Travelling Salesman Problem with Drone with Interceptions. ICCSA (2) 2023: 351-368 - 2018
- [c1]Mo Zhou, Yonatan Mintz, Yoshimi Fukuoka, Ken Goldberg, Elena Flowers, Philip M. Kaminsky, Alejandro Castillejo, Anil Aswani:
Personalizing Mobile Fitness Apps using Reinforcement Learning. IUI Workshops 2018
Reference Works
- 2004
- [r1]Philip M. Kaminsky, Dorit S. Hochbaum:
Due Date Quotation Models and Algorithms. Handbook of Scheduling 2004
Informal and Other Publications
- 2024
- [i2]Haotian Gu, Tim Jacobs, Philip M. Kaminsky, Xin Guo, Xinyu Li:
Transportation Market Rate Forecast Using Signature Transform. CoRR abs/2401.04857 (2024) - 2017
- [i1]Yonatan Mintz, Anil Aswani, Philip M. Kaminsky, Elena Flowers, Yoshimi Fukuoka:
Non-Stationary Bandits with Habituation and Recovery Dynamics. CoRR abs/1707.08423 (2017)
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-25 05:45 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:
