Mutsunori Yagiura
Orcid: 0000-0003-0970-9414
According to our database1,
Mutsunori Yagiura
authored at least 71 papers
between 1996 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
Eur. J. Oper. Res., 2025
2024
An iterated local search for a multi-period orienteering problem arising in a car patrolling application.
Networks, January, 2024
Heuristic algorithms based on column generation for an online product shipping problem.
Comput. Oper. Res., January, 2024
Proceedings of the Genetic and Evolutionary Computation Conference, 2024
2023
2022
An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion.
INFORMS J. Comput., 2022
A Metaheuristic Algorithm for a Multi-period Orienteering Problem arising in a Car Patrolling Application.
Proceedings of the 10th International Network Optimization Conference, 2022
An Iterated Local Search Algorithm for Commuting Bus Routing Problem with Latest Arrival Time Constraint.
Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management, 2022
2019
An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem.
Int. Trans. Oper. Res., 2019
2018
Relaxation heuristics for the set multicover problem with generalized upper bound constraints.
Comput. Oper. Res., 2018
Exact and heuristic algorithms for the interval min-max regret generalized assignment problem.
Comput. Ind. Eng., 2018
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
2015
INFORMS J. Comput., 2015
Expert Syst. Appl., 2015
Efficient implementations of construction heuristics for the rectilinear block packing problem.
Comput. Oper. Res., 2015
Proceedings of the 2015 IEEE International Conference on Industrial Engineering and Engineering Management, 2015
2014
Proceedings of the 2014 IEEE International Conference on Industrial Engineering and Engineering Management, 2014
An efficient method for checking overlaps and construction algorithms for the bitmap shape packing problem.
Proceedings of the 2014 IEEE International Conference on Industrial Engineering and Engineering Management, 2014
2013
A Heuristic Algorithm for the Set Multicover Problem with Generalized Upper Bound Constraints.
Proceedings of the Learning and Intelligent Optimization - 7th International Conference, 2013
2012
Comput. Oper. Res., 2012
2011
2010
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions.
J. Graph Algorithms Appl., 2010
Int. Trans. Oper. Res., 2010
The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio.
Comput. Oper. Res., 2010
Computing Bounds on Risk-neutral Distributions from the Observed Prices of Call Options.
Asia Pac. J. Oper. Res., 2010
Recent progress of local search in handling the time window constraints of the vehicle routing problem.
4OR, 2010
Proceedings of the Learning and Intelligent Optimization, 4th International Conference, 2010
2009
Solving the irregular strip packing problem via guided local search for overlap minimization.
Int. Trans. Oper. Res., 2009
Exact algorithms for the two-dimensional strip packing problem with and without rotations.
Eur. J. Oper. Res., 2009
An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem.
Discret. Optim., 2009
A textile design and the boolean rank problem.
Proceedings of the IADIS International Conference Applied Computing 2009, 2009
2008
Proceedings of the Hybrid Metaheuristics, An Emerging Approach to Optimization, 2008
J. Graph Algorithms Appl., 2008
IEICE Trans. Inf. Syst., 2008
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows.
Discret. Optim., 2008
An iterated local search algorithm for the vehicle routing problem with convex time penalty functions.
Discret. Appl. Math., 2008
A Path Relinking Approach with an Adaptive Mechanism to Control Parameters for the Vehicle Routing Problem with Time Windows.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2008
2007
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
Oper. Res. Lett., 2007
A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007
A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007
Proceedings of the Learning and Intelligent Optimization, Second International Conference, 2007
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007
2006
One-Dimensional Cutting Stock Problem with a Given Number of Setups: A Hybrid Approach of Metaheuristics and Linear Programming.
J. Math. Model. Algorithms, 2006
Eur. J. Oper. Res., 2006
A path relinking approach with ejection chains for the generalized assignment problem.
Eur. J. Oper. Res., 2006
Discret. Appl. Math., 2006
2005
Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints.
Transp. Sci., 2005
Improved local search algorithms for the rectangle packing problem with general spatial costs.
Eur. J. Oper. Res., 2005
2004
INFORMS J. Comput., 2004
A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem.
Discret. Optim., 2004
2003
Local search algorithms for the rectangle packing problem with general spatial costs.
Math. Program., 2003
An LP-Based Local Search to the One Dimensional Cutting Stock Problem Using a Given Number of Cutting Patterns.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003
Eur. J. Oper. Res., 2003
2001
Syst. Comput. Jpn., 2001
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation.
J. Heuristics, 2001
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001
2000
Algorithmica, 2000
Proceedings of the Intelligent Data Engineering and Automated Learning, 2000
1999
1998
On the Complexity of Deriving Score Functions from Examples for Problems in Molecular Biology.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998
Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998
1996
Proceedings of 1996 IEEE International Conference on Evolutionary Computation, 1996