The following pages link to Yoshitsugu Yamamoto (Q384200):
Displaying 50 items.
- Computational complexity of a solution for directed graph cooperative games (Q384201) (← links)
- A minimum violations ranking method (Q400018) (← links)
- Parameterized fairness axioms on cycle-free graph games (Q427375) (← links)
- Optimization over the efficient set: overview (Q598604) (← links)
- Bounding contingent claim prices via hedging strategy with coherent risk measures (Q662867) (← links)
- A path-following procedure to find a proper equilibrium of finite games (Q687992) (← links)
- A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes (Q689920) (← links)
- The existence and computation of competitive equilibria in markets with an indivisible commodity (Q1083355) (← links)
- The \((n+1)2^ m\)-ray algorithm: A new simplicial algorithm for the variational inequality problem on \(\mathbb{R}^ m_ +\times S^ n\) (Q1308654) (← links)
- A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes (Q1315417) (← links)
- A continuous deformation algorithm for variational inequality problems on polytopes (Q1330896) (← links)
- Convex programs with an additional constraint on the product of several convex functions (Q1333464) (← links)
- A finite algorithm for globally optimizing a class of rank-two reverse convex programs (Q1387650) (← links)
- A minimax rule for portfolio selection in frictional markets (Q1395151) (← links)
- (Q1609142) (redirect page) (← links)
- An aftertreatment technique for improving the accuracy of Adomian's decomposition method (Q1609143) (← links)
- Global optimization method for solving mathematical programs with linear complementarity constraints (Q1777600) (← links)
- A new variable dimension simplicial algorithm for computing economic equilibria on \(S^ n \times \mathbb{R}_ +^{m1}\) (Q1904696) (← links)
- Preference profiles determining the proposals in the Gale-Shapley algorithm for stable matching problems (Q1926654) (← links)
- A note on kernel principal component regression (Q1938788) (← links)
- Lagrangian relaxation and pegging test for the clique partitioning problem (Q2256778) (← links)
- A doubly nonnegative relaxation for modularity density maximization (Q2297659) (← links)
- An extension of the decomposition method for solving nonlinear equations and its convergence (Q2426897) (← links)
- On optimization over the efficient set in linear multicriteria programming (Q2471110) (← links)
- ROW AND COLUMN GENERATION ALGORITHMS FOR MINIMUM MARGIN MAXIMIZATION OF RANKING PROBLEMS (Q2799660) (← links)
- A Lagrangian Relaxation Algorithm for Modularity Maximization Problem (Q2806937) (← links)
- Row and Column Generation Algorithm for Maximization of Minimum Margin for Ranking Problems (Q2806938) (← links)
- IMPOSSIBILITY THEOREMS ON MUTUAL EVALUATION (Q3043688) (← links)
- LAGRANGIAN RELAXATION AND PEGGING TEST FOR LINEAR ORDERING PROBLEMS(<Special Issue>SCOPE (Seminar on Computation and OPtimization for new Extensions)) (Q3144756) (← links)
- A unifying model based on retraction for fixed point algorithms (Q3316473) (← links)
- A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm (Q3326743) (← links)
- A STUDY ON LINEAR INEQUALITY REPRESENTATION OF SOCIAL WELFARE FUNCTIONS(<Special Issue>Operations Research for Performance Evaluation) (Q3397567) (← links)
- (Q3470216) (← links)
- THE PATH FOLLOWING ALGORITHM FOR STATIONARY POINT PROBLEMS ON POLYHEDRAL CONES (Q3479828) (← links)
- METRIC-PRESERVING REDUCTION OF EARTH MOVER'S DISTANCE (Q3560106) (← links)
- RANKING BY RELATIONAL POWER BASED ON DIGRAPHS (Q3647388) (← links)
- A variable dimension fixed point algorithm and the orientation of simplices (Q3694554) (← links)
- ORIENTABILITY OF PSEUDOMANIFOLD AND GENERALIZATIONS OF SPERNER'S LEMMA (Q3802897) (← links)
- A Simplicial Algorithm for Stationary Point Problems on Polytopes (Q3829360) (← links)
- A GROUP THEORETIC DUAL PROBLEM WITHOUT DUALITY GAPS FOR BOUNDED INTEGER PROGRAMS (Q3885523) (← links)
- A new variable dimension algorithm for the fixed point problem (Q3959753) (← links)
- A variable dimension algorithm with the Dantzig-Wolfe decomposition for structured stationary point problems (Q4000924) (← links)
- A Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron (Q4012418) (← links)
- GENERALIZED FACTOR THEOREM AND AN ALGORITHM FOR FINDING A FACTOR (Q4172088) (← links)
- (Q4190658) (← links)
- (Q4216480) (← links)
- GLOBAL OPTIMIZATION PROBLEM WITH MULTIPLE REVERSE CONVEX CONSTRAINTS AND ITS APPLICATION TO OUT-OF-ROUNDNESS PROBLEM (Q4345054) (← links)
- A NOTE ON A THEOREM OF CONTINUUM OF ZERO POINTS (Q4538108) (← links)
- Continuum of Zero Points of a Mapping on a Compact, Convex Set (Q4651986) (← links)
- Global optimization method for solving the minimum maximal flow problem (Q4664042) (← links)
