Horácio Hideki Yanasse

Author

Instituto Nacional de Pesquisas Espaciais ORCID

Also Known As

H. H Yanasse, H. H. Yanasse, H. Yanasse, H.H. Yanasse, Horacio H. Yanasse, Horacio Hideki Yanasse, Horácio Hideki Yanasse, Horácio Hideki Yanasse, Yanasse, Horacio H.

Publications

1.9K

Citations

H-Index

Concepts

All Affiliations

Instituto Nacional de Pesquisas Espaciais Instituto Tecnológico de Aeronáutica Universidade Federal de São Paulo Universidade Federal de São Carlos Brazilian Society of Computational and Applied Mathematics

About

Horácio Hideki Yanasse is an author at Instituto Nacional de Pesquisas Espaciais specializing in engineering, operations research, and combinatorial optimization.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	19	30	1.6K
2	Business	11	12	1.1K
3	Social Sciences	3	3	51
4	Natural Sciences	2	2	76
5	Arts	1	1	20

Horácio Hideki Yanasse

Publications

1.8K

Citations

H-Index

Page 1

	Year	Citations
Computational Complexity of the Capacitated Lot Size Problem Gabriel R. Bitran, Horácio Hideki Yanasse Management Science Mathematical ProgrammingEngineeringParticular Cost StructureSingle Item ProblemCombinatorial Problem	1982	532
Deterministic Approximations to Stochastic Production Problems Gabriel R. Bitran, Horácio Hideki Yanasse Operations Research Mathematical ProgrammingProduction PlanningNonsequential CaseEngineeringStochastic Optimization	1984	104
The one-dimensional cutting stock problem with usable leftover – A heuristic approach Adriana Cristina Cherri, Marcos Nereu Arenales, Horácio Hideki Yanasse European Journal of Operational Research Mathematical ProgrammingEngineeringUsable LeftoverA Heuristic ApproachInventory Control	2008	83
A hybrid heuristic to reduce the number of different patterns in cutting stock problems Horácio Hideki Yanasse, Marcelo Saraiva Limeira Computers & Operations Research Production PlanningMathematical ProgrammingEngineeringIndustrial EngineeringCombinatorial Problem	2005	80
Approximation Methods for the Uncapacitated Dynamic Lot Size Problem Gabriel R. Bitran, Thomas L. Magnanti, Horácio Hideki Yanasse Management Science Mathematical ProgrammingEngineeringComputational ComplexityWorst Case ErrorOperations Research	1984	75
On a pattern sequencing problem to minimize the maximum number of open stacks Horácio Hideki Yanasse European Journal of Operational Research Mathematical ProgrammingEngineeringCombinatorial DesignCombinatorial ProblemCombinatorial Design Theory	1997	73
The one-dimensional cutting stock problem with usable leftovers – A survey Adriana Cristina Cherri, Marcos Nereu Arenales, Horácio Hideki Yanasse, European Journal of Operational Research Inventory ManagementEngineeringInventory ControlBusinessPacking Problems	2013	72
An integrated cutting stock and sequencing problem Horácio Hideki Yanasse, Maria José Pinto Lamosa European Journal of Operational Research Sequencing ProblemEngineeringIndustrial EngineeringProduction SchedulingManufacturing Planning	2006	70
Connections between cutting-pattern sequencing, VLSI design, and flexible machines Alexandre da Costa Linhares, Horácio Hideki Yanasse Computers & Operations Research Industrial DesignEngineeringDigital ManufacturingMachine ToolComputer Engineering	2002	69
A method for solving the minimization of the maximum number of open stacks problem within a cutting process José Carlos Becceneri, Horácio Hideki Yanasse, Nei Yoshihiro Soma Computers & Operations Research Mathematical ProgrammingCutting ProcessEngineeringIndustrial EngineeringOptimization Problem	2003	54

Page 1