A Lagrangian reconstruction of GENET

DOI10.1016/S0004-3702(00)00053-9zbMath0952.68133OpenAlexW2017316854MaRDI QIDQ1589464

K. M. F. Choi, Peter J. Stuckey, Jimmy Ho-man Lee

Publication date: 12 December 2000

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(00)00053-9

zbMATH Keywords

local searchconstraint satisfaction problemsdiscrete Lagrangian method

Mathematics Subject Classification ID

Knowledge representation (68T30)

Related Items

The island confinement method for reducing search space in local search methods

Uses Software

• Walksat

Cites Work

• Optimization by Simulated Annealing
• Scheduling with neural networks -- the case of the Hubble Space Telescope
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• Consistency in networks of relations
• Trace-based methods for solving nonlinear global optimization and satisfiability problems
• A discrete Lagrangian-based global-search method for solving satisfiability problems
• Locating the phase transition in binary constraint satisfaction problems
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Tabu Search—Part I
• Tabu Search—Part II
• Unnamed Item
• Unnamed Item