Iterated local search with Trellis-neighborhood for the partial Latin square extension problem

DOI10.1007/s10732-016-9317-6zbMath1360.90303OpenAlexW2522186741MaRDI QIDQ525111

Kazuya Haraguchi

Publication date: 28 April 2017

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://barrel.repo.nii.ac.jp/?action=repository_action_common_download&item_id=5189&item_no=1&attribute_id=19&file_no=1

zbMATH Keywords

metaheuristicslocal searchmaximum independent set problempartial Latin square extension problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

A massively parallel evolutionary algorithm for the partial Latin square extension problem

Uses Software

• CPLEX
• LocalSolver

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating and improving orthogonal designs by using mixed integer programming
• Fast local search for the maximum independent set problem
• An improved approximation algorithm for the partial Latin square extension problem.
• The complexity of completing partial Latin squares
• Cutting-edge research topics on multiple criteria decision making. 20th international conference, MCDM 2009, Chengdu/Jiuzhaigou, China, June 21--26, 2009. Proceedings
• Simple and fast surrogate constraint heuristics for the maximum independent set problem
• Approximating latin square extensions
• Optimizing with minimum satisfiability
• Round robin scheduling -- a survey
• A new class of facets for the Latin square polytope
• Searching for mutually orthogonal Latin squares via integer and constraint programming
• On Reducing Maximum Independent Set to Minimum Satisfiability
• Approximating the $$k$$-Set Packing Problem by Local Improvements
• On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
• A Generic Framework for Local Search: Application to the Sudoku Problem
• On Completing Latin Squares
• Finding orthogonal latin squares using finite model searching tools
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• An Efficient Local Search for Partial Latin Square Extension Problem
• Recent Advances in Constraints

This page was built for publication: Iterated local search with Trellis-neighborhood for the partial Latin square extension problem