scientific article; zbMATH DE number 1175963

zbMATH Open1068.90506MaRDI QIDQ4398380FDOQ4398380

Authors: Sebastián Ceria, Paolo Nobili, Antonio Sassano 

Publication date: 19 July 1998

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming (90-00)

Cited In (16)

• A three-phase methodology for developing or evaluating bank networks
• Analysis of three mathematical models of the staff rostering problem
• On a new class of nonlinear set covering problems arising in wireless network design
• An effective and simple heuristic for the set covering problem
• Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
• Set covering with almost consecutive ones property
• Solving the feedback vertex set problem on undirected graphs
• Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty
• A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
• Scheduling multi-colour print jobs with sequence-dependent setup times
• Composite-variable modeling for service parts logistics
• The robust set covering problem with interval data
• An electromagnetism metaheuristic for the unicost set covering problem
• Solving a minimum-power covering problem with overlap constraint for cellular network design
• A hybrid heuristic for the set covering problem
• Hyperbolic set covering problems with competing ground-set elements

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4398380)