default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTakayuki Shiina
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c34]Takuma Ohzeki, Tetsuya Sato, Takayuki Shiina, Ryunosuke Hamada:
Operational Planning of Fixed-Route Buses Considering the Charging of Electric Cars. IIAI-AAI 2022: 597-602- [c33]Yusuke Ishitani, Tetsuya Sato, Takayuki Shiina, Ryunosuke Hamada:
Solving stochastic integer-programming problems in electric bus introduction planning. IIAI-AAI 2022: 615-620 - [c32]Taichi Kawamura, Tetsuya Sato, Takayuki Shiina:
Multi-product Inventory Routing Problem Considering Demand Uncertainty. IIAI-AAI 2022: 621-626 - [c31]Tetsuya Sato, Takayuki Shiina, Ryunosuke Hamada:
Optimization of EV bus charging schedule by stochastic programming. IIAI-AAI 2022: 627-632 - [c30]Yang Chen, Tetsuya Sato, Takayuki Shiina:
A cutting-plane solution for chance-constrained unit commitment problems. IIAI-AAI 2022: 641-646 - 2021
- [c29]Yusuke Kusunoki, Tetsuya Sato, Takayuki Shiina:
Optimal Operation Model of Heat Pump for Multiple Residences. MCO 2021: 133-144 - [c28]Mio Imai, Tetsuya Sato, Takayuki Shiina:
Revenue Management Problem via Stochastic Programming in the Aviation Industry. MCO 2021: 145-157 - [c27]Keiya Kadota, Tetsuya Sato, Takayuki Shiina:
Stochastic Programming Model for Lateral Transshipment Considering Rentals and Returns. MCO 2021: 158-169 - 2020
- [c26]Atsuya Suzuki, Tomoki Fukuba, Takayuki Shiina:
Cutting plane method for the facility location problem with probabilistic constraints. IIAI-AAI 2020: 707-712 - [c25]Ryusei Mikami, Takayuki Shiina, Ken-ichi Tokoro:
Unit commitment problem considering market transaction. IIAI-AAI 2020: 713-718 - [c24]Ryota Omori, Takayuki Shiina:
New Formulation for the Vehicle Routing Problem with Stochastic Demands. IIAI-AAI 2020: 719-724 - [c23]Atsuya Suzuki, Tomoki Fukuba, Takayuki Shiina:
The Facility Location Problem with a Joint Probabilistic Constraint. IUKM 2020: 26-37 - [c22]Ryusei Mikami, Tomoki Fukuba, Takayuki Shiina, Ken-ichi Tokoro
:
Unit Commitment Problem in the Deregulated Market. IUKM 2020: 96-107 - [c21]Ryusei Mikami, Takayuki Shiina, Ken-ichi Tokoro:
Stochastic unit commitment problem in electricity market. SCIS/ISIS 2020: 1-6 - [c20]Ryota Omori, Takayuki Shiina:
Solution Algorithm for the Vehicle Routing Problem with Stochastic Demands. SCIS/ISIS 2020: 1-6 - [c19]Atsuya Suzuki, Tomoki Fukuba, Takayuki Shiina:
The facility location problem with probabilistic constraints. SCIS/ISIS 2020: 1-6
2010 – 2019
- 2019
- [c18]Tomoki Fukuba, Tetsuya Sato, Takayuki Shiina, Ken-ichi Tokoro:
Stochastic Nonlinear Programming Model for Power Plant Operation via Piecewise Linearization. IEEM 2019: 586-590 - [c17]Shuichi Isomura, Tetsuya Sato, Takayuki Shiina, Jun Imaizumi:
L-shaped Method for the Stochastic Vehicle Routing Problem. IEEM 2019: 591-595 - [c16]Risako Nibe, Takashi Hasuike, Takayuki Shiina:
Solution Method of News Vendor Problem with Price Elasticity of Demand by Parametric Stochastic Programming. IIAI-AAI 2019: 781-784 - [c15]Masato Dei, Tomoki Fukuba, Takayuki Shiina, Ken-ichi Tokoro:
Operational Plan for the Energy Plants Considering the Fluctuations in the Spot Price of Electricity. OR 2019: 257-263 - [c14]Sota Nakano, Jun Imaizumi, Takayuki Shiina:
Optimization of Rolling Stock Rostering Under Mutual Direct Operation. OR 2019: 749-755 - [c13]Tomoki Fukuba, Takayuki Shiina, Ken-ichi Tokoro:
Stochastic Programming for Energy Plant Operation. TAMC 2019: 208-221 - [c12]Tomoki Fukuba, Takayuki Shiina, Ken-ichi Tokoro, Tetsuya Sato:
Optimization of Power Plant Operation via Stochastic Programming with Recourse. WCGO 2019: 937-948 - 2018
- [c11]Takumi Kitamura, Takayuki Shiina:
Solution Algorithm for Time/Cost Trade-off Stochastic Project Scheduling Problem. OR 2018: 467-473 - 2016
- [c10]Susumu Morito, Yuho Takehi, Jun Imaizumi, Takayuki Shiina:
Optimization Models for Multi-period Railway Rolling Stock Assignment. ISCO 2016: 393-402 - 2015
- [c9]Takayuki Shiina, Susumu Morito, Jun Imaizumi:
Optimization of Railway Timetable by Allocation of Extra Time Supplements. OR 2015: 173-180 - 2014
- [c8]Takayuki Shiina, Takahiro Yurugi, Susumu Morito, Jun Imaizumi:
Unit Commitment by Column Generation. OR 2014: 559-565 - 2013
- [c7]Takayuki Shiina:
Solution Method for the Inventory Distribution Problem. OR 2013: 443-449 - 2010
- [c6]Takayuki Shiina:
Stochastic programming with binary second stage variables. ICCS 2010: 1407-1416
2000 – 2009
- 2009
- [j1]Takayuki Shiina:
Capacity Expansion Problem by Monte Carlo Sampling Method. J. Adv. Comput. Intell. Intell. Informatics 13(6): 697-703 (2009) - [c5]Takayuki Shiina:
Capacity Expansion Problem with Probabilistic Constraints. CSC 2009: 230-236 - 2008
- [c4]Takayuki Shiina, Jun Imaizumi:
Column Generation Method for Unit Commitment. CSC 2008: 64-70 - 2007
- [c3]Takayuki Shiina:
Stochastic Programming with Integer Variables. CSC 2007: 30-36 - 2006
- [c2]Takayuki Shiina:
Stochastic Programming via Importance Sampling. CSC 2006: 3-9
1990 – 1999
- 1993
- [c1]Shigeo Sagai, Yoshifumi Fujii, Takayuki Shiina:
An estimation of energy saving potential by the allocation of co-generation systems. System Modelling and Optimization 1993: 811-820
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 22:49 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:
