scientific article
From MaRDI portal
Publication:2726296
zbMath0995.68031MaRDI QIDQ2726296
Publication date: 17 July 2001
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) Randomized algorithms (68W20)
Related Items (12)
ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms ⋮ Enhanced ant colony optimization for multiscale problems ⋮ Hybrid methods in multi-criteria dynamic programming ⋮ DYNAMIC FACILITY LAYOUT WITH MULTI-OBJECTIVES ⋮ MPILS: an automatic tuner for MILP solvers ⋮ A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem ⋮ How to assess and report the performance of a stochastic algorithm on a benchmark problem: \textit{mean} or \textit{best} result on a number of runs? ⋮ A discrete gravitational search algorithm for solving combinatorial optimization problems ⋮ Ant algorithms and simulated annealing for multicriteria dynamic programming ⋮ Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times ⋮ Solving Engineering Optimization Problems Without Penalty ⋮ VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH
Uses Software
This page was built for publication:
