![](https://dblp.uni-trier.de/img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Hiroaki Sandoh
Person information
SPARQL queries ![](https://dblp.uni-trier.de/img/new.blue.24x12.png)
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2013
- [j10]Amirhossein Hosseinipour, Hiroaki Sandoh
:
Optimal business hours of the newsvendor problem for retailers. Int. Trans. Oper. Res. 20(6): 823-836 (2013) - 2009
- [j9]Takeshi Koide, Hiroaki Sandoh
:
Economic analysis of an n-unit parallel redundant system based on a Stackelberg game formulation. Comput. Ind. Eng. 56(1): 388-398 (2009) - 2007
- [j8]Haruhiko Suwa, Hiroaki Sandoh
:
Capability of cumulative delay based reactive scheduling for job shops with machine breakdowns. Comput. Ind. Eng. 53(1): 63-78 (2007) - 2006
- [j7]Koichiro Rinsaka, Hiroaki Sandoh
:
A stochastic model on an additional warranty service contract. Comput. Math. Appl. 51(2): 179-188 (2006) - [j6]Satoshi Mizutani, Toshio Nakagawa, Kodo Ito, Hiroaki Sandoh
:
Optimal periodic testing policy for circuit with self-testing. Comput. Math. Appl. 51(2): 363-370 (2006) - 2005
- [j5]Hidefumi Kawakatsu, Hiroaki Sandoh
:
A mathematical model for an optimal appointed delivery date on a home delivery market. RAIRO Oper. Res. 39(1): 3-12 (2005) - 2003
- [j4]Hiroaki Sandoh, Toshio Nakagawa:
How much should we reweigh? J. Oper. Res. Soc. 54(3): 318-321 (2003) - 2002
- [j3]Hiroaki Sandoh
, Roy Larke
:
A Theoretical Model for Testing New Product Sales Velocity at Small Format Retail Stores. RAIRO Oper. Res. 36(2): 157-172 (2002) - 2000
- [j2]Bermawi P. Iskandar, Hiroaki Sandoh:
An Extended Opportunity-Based Age Replacement Policy. RAIRO Oper. Res. 34(2): 145-154 (2000) - 1996
- [j1]Hiroaki Sandoh
, Hiroyuki Hirakoshi, Hajime Kawai:
An optimal time to sleep for an auto-sleep system. Comput. Oper. Res. 23(3): 221-227 (1996)
Conference and Workshop Papers
- 2019
- [c6]Jun Kiniwa, Hiroaki Sandoh:
A Multiplier Effect Model for Price Stabilization Networks. COMPLEX NETWORKS (2) 2019: 561-572 - [c5]Jun Kiniwa, Kensaku Kikuta, Hiroaki Sandoh:
Asynchronous Price Stabilization Model in Networks. ICAART (1) 2019: 121-128 - 2017
- [c4]Jun Kiniwa, Kensaku Kikuta, Hiroaki Sandoh:
Equilibrium bidding protocols for price stabilization in networks. BESC 2017: 1-6 - 2015
- [c3]Jun Kiniwa, Kensaku Kikuta, Hiroaki Sandoh:
An Inflation / Deflation Model for Price Stabilization in Networks. ICAART (1) 2015: 125-132 - 2012
- [c2]Jun Kiniwa, Takeshi Koide, Hiroaki Sandoh:
A New Variant of the Minority Game - Asset Value Game and its Extension. ICAART (2) 2012: 15-22 - [c1]Jun Kiniwa, Takeshi Koide, Hiroaki Sandoh
:
Asset Value Game and Its Extension: Taking Past Actions into Consideration. ICAART (Revised Selected Papers) 2012: 319-331
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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 22:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint