scientific article; zbMATH DE number 1175963
From MaRDI portal
Publication:4398380
zbMath1068.90506MaRDI QIDQ4398380
Sebastián Ceria, Antonio Sassano, Paolo Nobili
Publication date: 19 July 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (15)
An effective and simple heuristic for the set covering problem ⋮ Set covering with almost consecutive ones property ⋮ A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs ⋮ Composite-variable modeling for service parts logistics ⋮ The robust set covering problem with interval data ⋮ A hybrid heuristic for the set covering problem ⋮ Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs ⋮ Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty ⋮ Analysis of three mathematical models of the staff rostering problem ⋮ Solving the feedback vertex set problem on undirected graphs ⋮ On a new class of nonlinear set covering problems arising in wireless network design ⋮ An electromagnetism metaheuristic for the unicost set covering problem ⋮ Hyperbolic set covering problems with competing ground-set elements ⋮ Solving a minimum-power covering problem with overlap constraint for cellular network design ⋮ Scheduling multi-colour print jobs with sequence-dependent setup times
This page was built for publication:
