Pages that link to "Item:Q4074311"
From MaRDI portal
The following pages link to Note—A Computational Survey of Methods for the Set Covering Problem (Q4074311):
Displaying 19 items.
- A-priori upper bounds for the set covering problem (Q271942) (← links)
- On discrete optimization with ordering (Q367635) (← links)
- A formal model of diagnostic inference. I. Problem formulation and decomposition (Q1069317) (← links)
- A formal model of diagnostic inference. II. Algorithmic solution and application (Q1069318) (← links)
- On the facial structure of the set covering polytope (Q1122481) (← links)
- Facets and lifting procedures for the set covering polytope (Q1123808) (← links)
- Implicit enumeration algorithms for the set-partitioning problem (Q1143941) (← links)
- Determination of minimum number of sensors and their locations for an automated facility: An algorithmic approach (Q1205702) (← links)
- Methods for task allocation via agent coalition formation (Q1274277) (← links)
- Simple Lagrangian heuristic for the set covering problem (Q1278602) (← links)
- Algorithms for large scale set covering problems (Q1309874) (← links)
- The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems (Q1333026) (← links)
- A surrogate heuristic for set covering problems (Q1342046) (← links)
- Negotiation and cooperation in multi-agent environments (Q1391348) (← links)
- Hybrid heuristic algorithms for set covering. (Q1406642) (← links)
- Ordered weighted average optimization in multiobjective spanning tree problem (Q1753508) (← links)
- Dominant, an algorithm for the \(p\)-center problem. (Q1811146) (← links)
- An algorithm for set covering problem (Q1823139) (← links)
- Determining the Set of the Most Critical System Components—Optimization Approach (Q5110856) (← links)
