scientific article; zbMATH DE number 4160470

MaRDI QIDQ3487139zbMATH OpenFDO

Authors Elia El-Darzi, Gautam Mitra

Publication date 1990

zbMATH Keywords

assignment relaxationbranch and bound algorithmset coveringtree search approach

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Combinatorial optimization (90C27)

Recommendations

• Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations
• RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• Efficient solution methods for covering tree problems
• An approach to the solution of the set-covering problem
• A hybrid heuristic for the set covering problem
• A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
• Exact algorithms and applications for tree-like Weighted Set Cover
• A Heuristic Method for the Set Covering Problem
• An effective and simple heuristic for the set covering problem

Cited in

(5)

• Experiments with parallel branch-and-bound algorithms for the set covering problem
• Graph theoretic relaxations of set covering and set partitioning problems
• Implementation algorithms for solution of covering problems and analysis of their efficiency
• Some useful cost allocation strategies for the shortes route relaxation of the set covering problem
• Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations

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 Q3487139)