Pages that link to "Item:Q3875704"

The following pages link to Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study (Q3875704):

Displaying 50 items.

• 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)
• Set covering-based surrogate approach for solving sup-\({\mathcal{T}}\) equation constrained optimization problems (Q540668) (← links)
• Heuristic solutions and confidence intervals for the multicovering problem (Q579132) (← links)
• Cutting planes in integer and mixed integer programming (Q697578) (← links)
• Network models for vehicle and crew scheduling (Q792872) (← links)
• Using a facility location algorithm to solve large set covering problems (Q796457) (← links)
• A packet filter placement problem with application to defense against spoofed denial of service attacks (Q853001) (← links)
• The bi-objective covering tour problem (Q868132) (← links)
• A finite cutting plane method for solving linear programs with an additional reverse convex constraint (Q910336) (← links)
• Surrogate constraint normalization for the set covering problem (Q976352) (← links)
• Average and worst-case analysis of heuristics for the maximum tardiness problem (Q1080771) (← links)
• Entropy and set covering (Q1092816) (← links)
• Solving large set covering problems on a personal computer (Q1097839) (← links)
• A new approach for crew pairing problems by column generation with an application to air transportation (Q1098764) (← links)
• A finite procedure to generate feasible points for the extreme point mathematical programming problem (Q1103529) (← links)
• A structural Lagrangean relaxation for two-duty period bus driver scheduling problems (Q1121170) (← links)
• On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\) (Q1121793) (← links)
• On the 0,1 facets of the set covering polytope (Q1122477) (← links)
• On the facial structure of the set covering polytope (Q1122481) (← links)
• A probabilistic heuristic for a computationally difficult set covering problem (Q1122493) (← links)
• Facets and lifting procedures for the set covering polytope (Q1123808) (← links)
• Conditional clusters, musters, and probability (Q1169778) (← links)
• Enhancing an algorithm for set covering problems (Q1194745) (← links)
• The multicovering problem (Q1205691) (← links)
• Determination of minimum number of sensors and their locations for an automated facility: An algorithmic approach (Q1205702) (← links)
• An adaptation of SH heuristic to the location set covering problem (Q1278140) (← links)
• A genetic algorithm for the set covering problem (Q1278326) (← links)
• Computational experience with approximation algorithms for the set covering problem (Q1278941) (← links)
• A Lagrangian-based heuristic for large-scale set covering problems (Q1290617) (← links)
• Algorithms for large scale set covering problems (Q1309874) (← links)
• Pareto optimality and a class of set covering heuristics (Q1309875) (← links)
• Clustering heuristics for set covering (Q1309879) (← links)
• Experiments with parallel branch-and-bound algorithms for the set covering problem (Q1316095) (← links)
• State space relaxation for set covering problems related to bus driver scheduling (Q1322157) (← links)
• The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems (Q1333026) (← links)
• A column generation approach to job grouping for flexible manufacturing systems (Q1341988) (← links)
• A surrogate heuristic for set covering problems (Q1342046) (← links)
• On some difficult linear programs coming from set partitioning (Q1348247) (← links)
• Algorithms for railway crew management (Q1365052) (← links)
• Logical analysis of numerical data (Q1365054) (← links)
• Solving large set covering problems for crew scheduling (Q1367686) (← links)
• A comparison of algorithm RS with algorithm OPTSOL70 (Q1383315) (← links)
• Graph theoretic relaxations of set covering and set partitioning problems (Q1390264) (← links)
• The design of a 0-1 integer optimizer and its application in the Carmen system (Q1390346) (← links)
• Hybrid heuristic algorithms for set covering. (Q1406642) (← links)
• A neural network for the minimum set covering problem (Q1577203) (← links)
• A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles (Q1582189) (← links)
• A tabu search approach to the constraint satisfaction problem as a general problem solver (Q1609921) (← links)
• On a linearization technique for solving the quadratic set covering problem and variations (Q1676486) (← links)