scientific article; zbMATH DE number 2083802
From MaRDI portal
Publication:4739600
zbMath1054.68646MaRDI QIDQ4739600
Daniel Diaz, Philippe Codognet
Publication date: 6 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2264/22640073.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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
Contraint-based combinators for local search, Modeling the Costas array problem in QUBO for quantum annealing, A constraint-based local search backend for MiniZinc, Constraint-directed search for all-interval series, A simple tabu search for warehouse location, Solving the musical orchestration problem using multiobjective constrained optimization with a genetic local search approach, Large-scale parallelism for constraint-based local search: the costas array case study, Control abstractions for local search, Maintaining longest paths incrementally
Uses Software
