Yoshitsugu Yamamoto

According to our database1, Yoshitsugu Yamamoto authored at least 31 papers between 1978 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
A doubly nonnegative relaxation for modularity density maximization.
Discret. Appl. Math., 2020

2014
Decrease in on-state gate current of AlGaN/GaN HEMTs by recombination-enhanced defect reaction of generated hot carriers investigated by TCAD simulation.
Microelectron. Reliab., 2014

Row and Column Generation Algorithm for Maximization of Minimum Margin for Ranking Problems.
Proceedings of the Operations Research Proceedings 2014, 2014

A Lagrangian Relaxation Algorithm for Modularity Maximization Problem.
Proceedings of the Operations Research Proceedings 2014, 2014

2013
Lagrangian relaxation and pegging test for the clique partitioning problem.
Adv. Data Anal. Classif., 2013

Computational complexity of the average covering tree value.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012
Parameterized fairness axioms on cycle-free graph games.
J. Glob. Optim., 2012

2011
Bounding Contingent Claim Prices via Hedging Strategy with Coherent Risk Measures.
J. Optim. Theory Appl., 2011

2010
Metric-Preserving Reduction of Earth Mover's Distance.
Asia Pac. J. Oper. Res., 2010

2008
An extension of the decomposition method for solving nonlinear equations and its convergence.
Comput. Math. Appl., 2008

2006
Risk analysis of a pay to delay capacity reservation contract.
Optim. Methods Softw., 2006

2004
Continuum of Zero Points of a Mapping on a Compact, Convex Set.
SIAM J. Optim., 2004

2003
Global optimization method for solving the minimum maximal flow problem.
Optim. Methods Softw., 2003

A minimax rule for portfolio selection in frictional markets.
Math. Methods Oper. Res., 2003

Minimum Maximal Flow Problem: An Optimization over the Efficient Set.
J. Glob. Optim., 2003

2002
Optimization over the efficient set: overview.
J. Glob. Optim., 2002

1999
Heuristic Methods for Linear Multiplicative Programming.
J. Glob. Optim., 1999

1998
A Finite Algorithm for Globally Optimizing a Class of Rank-Two Reverse Convex Programs.
J. Glob. Optim., 1998

1994
A continuous deformation algorithm for variational inequality problems on polytopes.
Math. Program., 1994

1993
A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes.
Math. Program., 1993

The (<i>n</i> + 1)2<sup><i>m</i></sup>-ray algorithm: a new simplicial algorithm for the variational inequality problem on ℝ<sub>+</sub><sup><i>m</i></sup>×<i>S</i><sup>n</sup>.
Ann. Oper. Res., 1993

1992
A variable dimension algorithm with the Dantzig-Wolfe decomposition for structured stationary point problems.
ZOR Methods Model. Oper. Res., 1992

1991
A Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron.
SIAM J. Optim., 1991

1989
A Simplicial Algorithm for Stationary Point Problems on Polytopes.
Math. Oper. Res., 1989

1985
A Stochastic Approach for Estimating the Effectiveness of a Route Guidance System and Its Related Parameters.
Transp. Sci., 1985

1984
A variable dimension fixed point algorithm and the orientation of simplices.
Math. Program., 1984

A unifying model based on retraction for fixed point algorithms.
Math. Program., 1984

A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm.
Math. Program., 1984

1983
A new variable dimension algorithm for the fixed point problem.
Math. Program., 1983

1982
Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods.
Math. Program., 1982

1978
The Held - Karp algorithm and degree-constrained minimum 1-trees.
Math. Program., 1978


  Loading...