The following pages link to Ping Zhan (Q1335566):
Displayed 13 items.
- An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane (Q1335567) (← links)
- Extended random assignment mechanisms on a family of good sets (Q2241324) (← links)
- A simple construction of complete single-peaked domains by recursive tiling (Q2283307) (← links)
- Submodular optimization views on the random assignment problem (Q2330658) (← links)
- A DUAL ALGORITHM FOR FINDING THE MINIMUM-NORM POINT IN A POLYTOPE (Q3197625) (← links)
- (Q3448136) (← links)
- A POLYNOMIAL ALGORITHM FOR ENUMERATING ALL VERTICES OF A BASE POLYHEDRON (Q4366145) (← links)
- A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES (Q5288735) (← links)
- POLYHEDRA AND OPTIMIZATION RELATED TO A WEAK ABSOLUTE MAJORIZATION ORDERING (Q5694059) (← links)
- Monotone diameter of bisubmodular polyhedra (Q6063788) (← links)
- A simple characterization of assignment mechanisms on set constraints (Q6155636) (← links)
- Simultaneous eating algorithm and greedy algorithm in assignment problems (Q6176397) (← links)
- Sign representation of single-peaked preferences and Bruhat orders (Q6391923) (← links)