An efficient mean field approach to the set covering problem

DOI10.1016/S0377-2217(00)00205-8zbMath1002.90054MaRDI QIDQ5943937

Carsten Peterson, Mattias Ohlsson, Bo Söderberg

Publication date: 21 January 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationset coveringartificial neural network algorithmmean field annealing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (8)

Minimizing fleet operating costs for a container transportation company ⋮ Dual mean field search for large scale linear and quadratic knapsack problems ⋮ An effective and simple heuristic for the set covering problem ⋮ Dual mean field annealing scheme for binary optimization under linear constraints ⋮ Covering models and optimization techniques for emergency response facility location and planning: a review ⋮ A new approach for solving set covering problem using jumping particle swarm optimization method ⋮ The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory ⋮ An adaptive heuristic algorithm for VLSI test vectors selection

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• ``Neural computation of decisions in optimization problems
• An interior point algorithm to solve computationally difficult set covering problems
• A genetic algorithm for the set covering problem
• Computational experience with approximation algorithms for the set covering problem
• A Lagrangian-based heuristic for large-scale set covering problems
• Airline crew scheduling using Potts mean field techniques
• An algorithm for set covering problem
• Solving hard set covering problems

This page was built for publication: An efficient mean field approach to the set covering problem