An efficient local search for the constrained symmetric Latin square construction problem

DOI10.15807/JORSJ.60.439MaRDI QIDQ4609155zbMATH OpenOpenAlexFDO

Authors Kazuya Haraguchi

Publication date 29 March 2018

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.60.439

zbMATH Keywords

combinatorial optimizationalgorithmlocal searchschedulingLatin square

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Recommendations

• An efficient local search for partial Latin square extension problem
• Iterated local search with Trellis-neighborhood for the partial Latin square extension problem
• On Completing Latin Squares
• scientific article; zbMATH DE number 1975618
• Approximating latin square extensions

Cited in

(2)

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

Describes a project that uses

Uses Software

• LocalSolver
• CPLEX

This page was built for publication: An efficient local search for the constrained symmetric Latin square construction problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4609155)