![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Atsuo Suzuki
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j10]Pawel Jan Kalczynski, Atsuo Suzuki, Zvi Drezner:
Multiple obnoxious facilities with weighted demand points. J. Oper. Res. Soc. 73(3): 598-607 (2022) - 2020
- [i1]Pawel Jan Kalczynski, Atsuo Suzuki, Zvi Drezner:
Obnoxious facility location: the case of weighted demand points. CoRR abs/2008.04386 (2020)
2010 – 2019
- 2011
- [c3]Chaya Losada, Atsuo Suzuki:
Optimizing strategic planning in median systems subject to uncertain disruption and gradual recovery. OR 2011: 293-298 - 2010
- [j9]Atsuo Suzuki, Katsushige Sawaki:
The Valuation of Russian Options for Double Exponential Jump Diffusion Processes. Asia Pac. J. Oper. Res. 27(2): 227-242 (2010) - [j8]Zvi Drezner, Atsuo Suzuki:
Covering continuous demand in the plane. J. Oper. Res. Soc. 61(5): 878-881 (2010)
2000 – 2009
- 2009
- [j7]Atsuo Suzuki, Zvi Drezner:
The minimum equitable radius location problem with continuous demand. Eur. J. Oper. Res. 195(1): 17-30 (2009) - [j6]Atsuo Suzuki, Katsushige Sawaki:
Callable Russian Options and Their Optimal Boundaries. Adv. Decis. Sci. 2009: 593986:1-593986:13 (2009) - [c2]Hajime Miyazawa, Takehiro Furuta, Atsuo Suzuki:
An Approximate Parallel Solution of the Vertex p-Center Problem Using Network Voronoi Diagram. PDPTA 2009: 520-525 - 2008
- [j5]Atsuyuki Okabe, Toshiaki Satoh, Takehiro Furuta
, Atsuo Suzuki, K. Okano:
Generalized network Voronoi diagrams: Concepts, computational methods, and applications. Int. J. Geogr. Inf. Sci. 22(9): 965-994 (2008) - [j4]Mihiro Sasaki, Takehiro Furuta
, Atsuo Suzuki:
Exact optimal solutions of the minisum facility and transfer points location problems on a network. Int. Trans. Oper. Res. 15(3): 295-306 (2008) - 2007
- [c1]Takehiro Furuta
, Hajime Miyazawa, Fumio Ishizaki, Mihiro Sasaki, Atsuo Suzuki:
A heuristic method for clustering a large-scale sensor network. WTS 2007: 1-6 - 2006
- [j3]Atsuo Suzuki, Katsushige Sawaki, Toshiharu Hasegawa:
An OR/MS Approach to Managing Nanzan Gakuen (Nanzan Educational Complex): From the Strategic to the Daily Operational Level. Interfaces 36(1): 43-54 (2006) - 2004
- [j2]Zvi Drezner, Atsuo Suzuki:
The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems. Oper. Res. 52(1): 128-135 (2004)
1990 – 1999
- 1999
- [j1]Mihiro Sasaki, Atsuo Suzuki, Zvi Drezner:
On the selection of hub airports for an airline hub-and-spoke system. Comput. Oper. Res. 26(14): 1411-1422 (1999)
Coauthor Index
![](https://dblp.org/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-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint