Iterated local search with Trellis-neighborhood for the partial Latin square extension problem
type: Item
instance of: scholarly article
title: Iterated local search with Trellis-neighborhood for the partial Latin square extension problem
zbMATH Open document ID: 1360.90303
author: Kazuya Haraguchi
published in: Journal of Heuristics
publication date: 2017-04-28T00:00:00Z
full work available at URL: https://barrel.repo.nii.ac.jp/
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6708817
zbMATH Keywords: partial Latin square extension problem
zbMATH Keywords: maximum independent set problem
zbMATH Keywords: metaheuristics
zbMATH Keywords: local search
describes a project that uses: CPLEX
describes a project that uses: LocalSolver
MaRDI profile type: Publication
OpenAlex ID: W2522186741
cites work: Simple and fast surrogate constraint heuristics for the maximum independent set problem
cites work: Fast local search for the maximum independent set problem
cites work: Searching for mutually orthogonal Latin squares via integer and constraint programming
cites work: A new class of facets for the Latin square polytope
cites work: Recent Advances in Constraints
cites work: The complexity of completing partial Latin squares
cites work: Q3411976
cites work: Cutting-edge research topics on multiple criteria decision making. 20th international conference, MCDM 2009, Chengdu/Jiuzhaigou, China, June 21--26, 2009. Proceedings
cites work: Approximating the $$k$$-Set Packing Problem by Local Improvements
cites work: Q4198056
cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
cites work: An improved approximation algorithm for the partial Latin square extension problem.
cites work: On Completing Latin Squares
cites work: An Efficient Local Search for Partial Latin Square Extension Problem
cites work: Round robin scheduling -- a survey
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: 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
cites work: On Reducing Maximum Independent Set to Minimum Satisfiability
cites work: Approximating latin square extensions
cites work: A Generic Framework for Local Search: Application to the Sudoku Problem
cites work: Q3624095
cites work: Optimizing with minimum satisfiability
cites work: Finding orthogonal latin squares using finite model searching tools
cites work: Q3223911
cites work: Generating and improving orthogonal designs by using mixed integer programming
DOI: 10.1007/S10732-016-9317-6
description: scientific article; zbMATH DE number 6708817