Horacio Hideki Yanasse

From MaRDI portal
Person:991071

Available identifiers

zbMath Open yanasse.horacio-hidekiWikidataQ100390473 ScholiaQ100390473MaRDI QIDQ991071

List of research outcomes

PublicationDate of PublicationType
Mathematical models for the minimization of open stacks problem2023-11-29Paper
Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost2022-08-26Paper
The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics2019-10-14Paper
Scheduling identical parallel machines with tooling constraints2018-05-24Paper
A heuristic approach to minimize the number of saw cycles in small-scale furniture factories2017-12-15Paper
Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints2017-06-29Paper
The one-dimensional cutting stock problem with usable leftovers -- a survey2015-07-29Paper
The usable leftover one‐dimensional cutting stock problem—a priority‐in‐use heuristic2013-05-23Paper
Connections between cutting-pattern sequencing, VLSI design, and flexible machines2013-03-25Paper
Observations on optimal parallelizations of two-list algorithm2010-09-02Paper
An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem2010-03-06Paper
The minimization of open stacks problem: a review of some properties and their use in pre-processing operations2009-12-21Paper
The one-dimensional cutting stock problem with usable leftover - a heuristic approach2009-12-07Paper
A note on linear models for two-group and three-group two-dimensional guillotine cutting problems2009-02-24Paper
Parallel time and space upper-bounds for the subset-sum problem2008-11-18Paper
An enumeration scheme to generate constrained exact checkerboard patterns2007-11-30Paper
An integrated cutting stock and sequencing problem2007-08-27Paper
An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem2006-11-15Paper
Linear models for 1-group two-dimensional guillotine cutting problems2006-08-28Paper
A hybrid heuristic to reduce the number of different patterns in cutting stock problems2006-05-16Paper
Checkerboard pattern: proposals for its generation2005-04-15Paper
Refinements on an enumeration scheme for solving a pattern sequencing problem2005-01-31Paper
A method for solving the minimization of the maximum number of open stacks problem within a cutting process2004-11-18Paper
Comments on parallel algorithms for the knapsack problem.2003-01-21Paper
On a pattern sequencing problem to minimize the maximum number of open stacks1999-02-22Paper
A polynomial approximation scheme for the subset sum problem1995-04-10Paper
A search strategy for the one-size assortment problem1994-07-21Paper
Two-dimensional Cutting Stock with Multiple Stock Sizes1991-01-01Paper
EOQ Systems: The Case of an Increase in Purchase Cost1990-01-01Paper
A new enumeration scheme for the knapsack problem1987-01-01Paper
Approximation Methods for the Uncapacitated Dynamic Lot Size Problem1984-01-01Paper
Deterministic Approximations to Stochastic Production Problems1984-01-01Paper
Computational Complexity of the Capacitated Lot Size Problem1982-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Horacio Hideki Yanasse