Pages that link to "Item:Q1278941"

The following pages link to Computational experience with approximation algorithms for the set covering problem (Q1278941):

Displaying 26 items.

• A-priori upper bounds for the set covering problem (Q271942) (← links)
• An efficient local search heuristic with row weighting for the unicost set covering problem (Q319859) (← links)
• Solving a bicriteria problem of optimal service centers location (Q367241) (← links)
• Randomized approximation of bounded multicovering problems (Q679446) (← links)
• An effective and simple heuristic for the set covering problem (Q853015) (← links)
• A GRASP algorithm to solve the unicost set covering problem (Q878597) (← links)
• Surrogate constraint normalization for the set covering problem (Q976352) (← links)
• Model-based view planning (Q1008495) (← links)
• An adaptive heuristic algorithm for VLSI test vectors selection (Q1042192) (← links)
• Computational experience with approximation algorithms for the set covering problem (Q1278941) (← links)
• On a linearization technique for solving the quadratic set covering problem and variations (Q1676486) (← links)
• Optimal RSUs placement with delay bounded message dissemination in vehicular networks (Q2012886) (← links)
• Column generation extensions of set covering greedy heuristics (Q2102849) (← links)
• Siting renewable power generation assets with combinatorial optimisation (Q2119746) (← links)
• A theoretical justification of the set covering greedy heuristic of Caprara et al. (Q2172080) (← links)
• An improved configuration checking-based algorithm for the unicost set covering problem (Q2239985) (← links)
• A new approach for solving set covering problem using jumping particle swarm optimization method (Q2311260) (← links)
• Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems (Q2329727) (← links)
• A relax-and-cut algorithm for the set partitioning problem (Q2462542) (← links)
• Experimental analysis of approximation algorithms for the vertex cover and set covering problems (Q2496053) (← links)
• The set covering problem revisited: an empirical study of the value of dual information (Q2514674) (← links)
• Fractional Set Cover in the Streaming Model. (Q5002615) (← links)
• Efficient Design of Compact Unstructured RNA Libraries Covering All k-mers (Q5283834) (← links)
• Set covering approach for reconstruction of sibling relationships (Q5758164) (← links)
• An efficient mean field approach to the set covering problem (Q5943937) (← links)
• Building a large location table to find replicas of physics objects (Q5952540) (← links)