scientific article
From MaRDI portal
Publication:3500142
zbMath1162.90519MaRDI QIDQ3500142
Publication date: 3 June 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Large-scale problems in mathematical programming (90C06) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)
Related Items (11)
Relaxation heuristics for the set multicover problem with generalized upper bound constraints ⋮ MLQCC: an improved local search algorithm for the set k‐covering problem ⋮ The Impact of a New Formulation When Solving the Set Covering Problem Using the ACO Metaheuristic ⋮ Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs ⋮ RAMP for the capacitated minimum spanning tree problem ⋮ An improved configuration checking-based algorithm for the unicost set covering problem ⋮ A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem ⋮ An electromagnetism metaheuristic for the unicost set covering problem ⋮ Solving the non-unicost set covering problem by using cuckoo search and black hole optimization ⋮ A self-adaptive biogeography-based algorithm to solve the set covering problem ⋮ A set covering approach for multi-depot train driver scheduling
This page was built for publication:
