Mutsunori Yagiura

From MaRDI portal
Person:535011

Available identifiers

zbMath Open yagiura.mutsunoriMaRDI QIDQ535011

List of research outcomes





PublicationDate of PublicationType
Packing squares independently2024-12-12Paper
A heuristic algorithm for the drone rural postman problem2024-05-14Paper
An iterated local search for a multi‐period orienteering problem arising in a car patrolling application2024-01-18Paper
An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem†2023-11-16Paper
An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion2022-12-01Paper
An Iterated Dual Substitution Approach for Binary Integer Programming Problems under the Min-Max Regret Criterion2020-12-10Paper
Relaxation heuristics for the set multicover problem with generalized upper bound constraints2018-07-11Paper
EFFICIENT OVERLAP DETECTION AND CONSTRUCTION ALGORITHMS FOR THE BITMAP SHAPE PACKING PROBLEM2018-05-18Paper
Efficient implementations of construction heuristics for the rectilinear block packing problem2016-11-10Paper
A partition-based heuristic algorithm for the rectilinear block packing problem2016-10-27Paper
Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem2016-01-25Paper
ENUMERATING BOTTOM-LEFT STABLE POSITIONS FOR RECTANGLE PLACEMENTS WITH OVERLAP2014-09-09Paper
Recent progress of local search in handling the time window constraints of the vehicle routing problem2013-08-08Paper
Lagrangian-based column generation for the node capacitated in-tree packing problem2012-12-08Paper
An LP-based heuristic algorithm for the node capacitated in-tree packing problem2012-11-15Paper
The complexity of the node capacitated in-tree packing problem2012-06-18Paper
An ejection chain approach for the generalized assignment problem2012-06-08Paper
Efficient local search algorithms for the linear ordering problem2011-05-20Paper
Efficient branch-and-bound algorithms for weighted MAX-2-SAT2011-05-11Paper
A fast algorithm for computing a nearly equitable edge coloring with balanced conditions2011-02-16Paper
Recent progress of local search in handling the time window constraints of the vehicle routing problem2010-12-06Paper
COMPUTING BOUNDS ON RISK-NEUTRAL DISTRIBUTIONS FROM THE OBSERVED PRICES OF CALL OPTIONS2010-06-10Paper
Solving the irregular strip packing problem via guided local search for overlap minimization2010-01-29Paper
An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem2009-11-23Paper
The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio2009-10-15Paper
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions2009-07-23Paper
Exact algorithms for the two-dimensional strip packing problem with and without rotations2009-06-30Paper
A set covering approach for the pickup and delivery problem with general constraints on each route2009-06-11Paper
An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem2009-01-19Paper
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows2008-10-29Paper
An iterated local search algorithm for the vehicle routing problem with convex time penalty functions2008-09-10Paper
New Bounds for the Nearly Equitable Edge Coloring Problem2008-05-27Paper
RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)2008-04-29Paper
A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem2007-11-29Paper
A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route2007-11-29Paper
Duality in option pricing based on prices of other derivatives2007-08-27Paper
The vehicle routing problem with flexible time windows and traveling times2007-01-09Paper
One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming2006-09-28Paper
A 3-flip neighborhood local search for the set covering problem2006-04-28Paper
Heuristic approaches to the capacitated square covering problem2006-02-08Paper
https://portal.mardi4nfdi.de/entity/Q33686542006-02-08Paper
A path relinking approach with ejection chains for the generalized assignment problem2005-10-26Paper
A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem2005-08-22Paper
Improved local search algorithms for the rectangle packing problem with general spatial costs2005-08-01Paper
A decomposability index in logical analysis of data2004-08-19Paper
https://portal.mardi4nfdi.de/entity/Q44740962004-08-04Paper
Local search algorithms for the rectangle packing problem with general spatial costs2003-09-01Paper
Finding essential attributes from binary data2003-08-21Paper
One-dimensional cutting stock problem to minimize the number of different patterns2003-04-10Paper
Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: experimental Evaluation2002-12-15Paper
Analyses on the 2 and 3-flip neighborhoods for the MAX SAT2001-03-04Paper
https://portal.mardi4nfdi.de/entity/Q47619452001-02-21Paper
https://portal.mardi4nfdi.de/entity/Q47619472001-02-21Paper
https://portal.mardi4nfdi.de/entity/Q47619502001-02-21Paper
A variable depth search algorithm with branching search for the generalized assignment problem2000-10-29Paper
https://portal.mardi4nfdi.de/entity/Q44952042000-08-10Paper
Fast algorithms to enumerate all common intervals of two permutations2000-03-19Paper
https://portal.mardi4nfdi.de/entity/Q47031551999-12-14Paper
https://portal.mardi4nfdi.de/entity/Q42184121998-11-11Paper
The use of dynamic programming in genetic algorithms for permutation problems1998-10-18Paper
https://portal.mardi4nfdi.de/entity/Q43500371997-08-28Paper

Research outcomes over time

This page was built for person: Mutsunori Yagiura