Computer Solutions to Minimum-Cover Problems
From MaRDI portal
Publication:5562360
DOI10.1287/opre.17.3.455zbMath0174.20706OpenAlexW2098782455MaRDI QIDQ5562360
No author found.
Publication date: 1969
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.17.3.455
Numerical mathematical programming methods (65K05) Integer programming (90C10) Numerical algorithms for specific classes of architectures (65Y10)
Related Items (19)
Randomized algorithms in combinatorial optimization: A survey ⋮ Two new heuristics for the location set covering problem ⋮ Solving large set covering problems on a personal computer ⋮ Minimal covering problem and PLA minimization ⋮ A comparison of algorithm RS with algorithm OPTSOL70 ⋮ Relation between set partitioning and set covering problems with quadratic fractional objective functions ⋮ Enumeration technique for solving multi-objective quadratic set-covering problem using goal programming ⋮ Bayesian nonparametrie inference and monte carlo optimization ⋮ A fundamental problem in linear inequalities with applications to the travelling salesman problem ⋮ A Linearization technique for solving the quadratic set covering problem ⋮ Emergency rescue location model with uncertain rescue time ⋮ An optimal method for solving the (generalized) multi-Weber problem ⋮ A goal programming approach to solve linear fractional multi-objective set covering problem. ⋮ Heuristically aided set-covering algorithms ⋮ Generalized coverage: new developments in covering location models ⋮ An adaptation of SH heuristic to the location set covering problem ⋮ On Haar's dual problem ⋮ Using a facility location algorithm to solve large set covering problems ⋮ Linearization approach to multi objective set covering problem with imprecise nonlinear fractional objectives
This page was built for publication: Computer Solutions to Minimum-Cover Problems
