Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Ping Zhan
Observed name:
Zhan, Ping
Institution:
Edogawa University
Observed institutions:
University of Tsukuba,
Edogawa University
ORCID:
0000-0002-1183-1550
Observed ORCID:
0000-0002-1183-1550
OpenAlex ID:
A5075473282
Works
22
Awards
1
A Dual Algorithm for Finding the Minimum-norm Point in a Polytope
1990
·
Satoru Fujishige
, Ping Zhan
·
Journal of the Operations Research Society of Japan
·
15
PDF
The Random Assignment Problem with Submodular Constraints on Goods
2018
·
Satoru Fujishige
, Yoshio Sano
, et al.
·
ACM Transactions on Economics and Computation
·
9
PDF
A Dual Algorithm for Finding a Nearest Pair of Points in Two Polytopes
1992
·
Satoru Fujishige
, Ping Zhan
·
Journal of the Operations Research Society of Japan
·
9
PDF
An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane
1994
·
Satoru Fujishige
, Hiroko Sato
, et al.
·
Japan Journal of Industrial and Applied Mathematics
·
7
Submodular optimization views on the random assignment problem
2018
·
Satoru Fujishige
, Yoshio Sano
, et al.
·
Mathematical Programming
·
5
PDF
A simple construction of complete single-peaked domains by recursive tiling
2019
·
Ping Zhan
·
Mathematical Methods of Operations Research
·
4
PDF
Simultaneous eating algorithm and greedy algorithm in assignment problems
2023
·
Ping Zhan
·
Journal of Combinatorial Optimization
·
3
PDF
Extended Random Assignment Mechanisms on a Family of Good Sets
2021
·
Yoshio Sano
, Ping Zhan
·
Operations Research Forum
·
3
A Simple Characterization of Assignment Mechanisms on Set Constraints
2023
·
Ping Zhan
·
Operations Research Forum
·
2
PDF
A Polynomial Algorithm for Enumerating All Vertices of a Base Polyhedron
1997
·
Ping Zhan
·
Journal of the Operations Research Society of Japan
·
2
PDF
Monotone Diameter of Bisubmodular Polyhedra
2023
·
Yasuko Matsui
, Noriyoshi Sukegawa
, et al.
·
Operations Research Forum
·
1
Random assignment under ordinal preferences: a separation characterisation
2017
·
Ping Zhan
·
Asian J of Management Science and Applications
·
1
Polyhedra and Optimization Related to a Weak Absolute Majorization Ordering
2005
·
Ping Zhan
·
Journal of the Operations Research Society of Japan
·
1
PDF
Ex ante and ex post envy-freeness on polytope resources
2024
·
Yoshio Sano
, Ping Zhan
·
Japan Journal of Industrial and Applied Mathematics
A First Efficient Algorithm for Enumerating All the Extreme Points of a Bisubmodular Polyhedron
2024
·
Yasuko Matsui
, Takeshi Naitoh
, et al.
·
SSRN Electronic Journal
A PolyNOmial-time Algorithm for Enumerating All Vertices of Bisubmodular Polyhedra
2005
·
Zhan, Ping
, Naito, Takeshi
·
Institutional Repositories DataBase (IRDB)
The monotonic diameter of bisubmodular polyhedra
2001
·
Ping Zhan
·
情報と社会
A Polynomial Algorithm for Enumerating all Vertices of a BisubmodularPolyhedron
1999
·
Ping Zhan
·
情報と社会
The upper bound of monotonic deameter of bisubmodular polyhedra
1998
·
Ping Zhan
·
情報と社会
A Polynomial Algorithm For Enumerating Vertices Of A Base Polyhedron
1995
·
Ping Zhan
·
日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集
凸多面体上の最小ノルム点を見出す算法及び関連問題
1993
·
Zhan, Ping
·
Institutional Repositories DataBase (IRDB)
Dynamic Programming Algorithms for Lot-Sizing Problems
·
ザン, ピン
, Zhan, Ping
·
Institutional Repositories DataBase (IRDB)
Show more works
View as search
Works count:
22
Citation count:
62
H-index:
5
I10-index:
1
Year
Topic
Type
