Computer Solutions to Minimum-Cover Problems
From MaRDI portal
Recommendations
Cited in
(36)- On Haar's dual problem
- Linearization approach to multi objective set covering problem with imprecise nonlinear fractional objectives
- Minimax problems with bitonic matrices
- Solution of problems of minimal set partition and set covering
- Minimal covering problem and PLA minimization
- scientific article; zbMATH DE number 4045478 (Why is no real title available?)
- Algorithms and Computation
- Randomized algorithms in combinatorial optimization: A survey
- An optimal method for solving the (generalized) multi-Weber problem
- Instance-specific accelerators for minimum covering
- Implementation algorithms for solution of covering problems and analysis of their efficiency
- Bayesian nonparametrie inference and monte carlo optimization
- A fundamental problem in linear inequalities with applications to the travelling salesman problem
- Generalized coverage: new developments in covering location models
- Minimum ratio cover of matrix columns by extreme rays of its induced cone
- Two new heuristics for the location set covering problem
- Solving large set covering problems on a personal computer
- scientific article; zbMATH DE number 3910436 (Why is no real title available?)
- Heuristically aided set-covering algorithms
- An adaptation of SH heuristic to the location set covering problem
- Enumeration technique for solving multi-objective quadratic set-covering problem using goal programming
- Relation between set partitioning and set covering problems with quadratic fractional objective functions
- scientific article; zbMATH DE number 3943835 (Why is no real title available?)
- A solution construction method for solving a specified covering problem
- A Set-Covering Approach to Customized Coverage Instrumentation
- Solving the set cover problem on a supercomputer
- The multicovering problem
- Breaking symmetries from a set-covering perspective
- A comparison of algorithm RS with algorithm OPTSOL70
- Using a facility location algorithm to solve large set covering problems
- An approach to the solution of the set-covering problem
- AE1: An extension matrix approximate method for the general covering problem
- A Linearization technique for solving the quadratic set covering problem
- A goal programming approach to solve linear fractional multi-objective set covering problem.
- Maximally disjoint solutions of the set covering problem
- Emergency rescue location model with uncertain rescue time
This page was built for publication: Computer Solutions to Minimum-Cover Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5562360)
