A general approach for constraint solving by local search
From MaRDI portal
Publication:1876601
DOI10.1023/B:JMMA.0000026709.24659.dazbMath1076.68071OpenAlexW2001157763MaRDI QIDQ1876601
Philippe Galinier, Jin-Kao Hao
Publication date: 20 August 2004
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:jmma.0000026709.24659.da
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Generic incremental algorithms for local search, Modeling the Costas array problem in QUBO for quantum annealing, A tabu search algorithm for the covering design problem, The case for strategic oscillation, Models and solution techniques for frequency assignment problems, Multicriteria models for planning power-networking events, Integrating domain and constraint privacy reasoning in the distributed stochastic algorithm with breakouts, Large-scale parallelism for constraint-based local search: the costas array case study, Control abstractions for local search, Maintaining longest paths incrementally
Uses Software
