Pages that link to "Item:Q3487135"
From MaRDI portal
The following pages link to Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics (Q3487135):
Displaying 50 items.
- An efficient local search heuristic with row weighting for the unicost set covering problem (Q319859) (← links)
- A hybrid heuristic for the set covering problem (Q373244) (← links)
- Benders decomposition for set covering problems. Almost satisfying the consecutive ones property (Q512865) (← links)
- Set covering-based surrogate approach for solving sup-\({\mathcal{T}}\) equation constrained optimization problems (Q540668) (← links)
- Solving a fuzzy set-covering problem (Q557144) (← links)
- Exploring further advantages in an alternative formulation for the set covering problem (Q783157) (← links)
- A packet filter placement problem with application to defense against spoofed denial of service attacks (Q853001) (← links)
- An effective and simple heuristic for the set covering problem (Q853015) (← links)
- Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study (Q853072) (← links)
- A GRASP algorithm to solve the unicost set covering problem (Q878597) (← links)
- A dual ascent procedure for the set partitioning problem (Q955334) (← links)
- Surrogate constraint normalization for the set covering problem (Q976352) (← links)
- Enhancing an algorithm for set covering problems (Q1194745) (← links)
- A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints (Q1198141) (← links)
- An adaptation of SH heuristic to the location set covering problem (Q1278140) (← links)
- A genetic algorithm for the set covering problem (Q1278326) (← links)
- Simple Lagrangian heuristic for the set covering problem (Q1278602) (← links)
- A multi-product loading problem: A model and solution method (Q1278990) (← links)
- A Lagrangian-based heuristic for large-scale set covering problems (Q1290617) (← links)
- Clustering heuristics for set covering (Q1309879) (← links)
- Experiments with parallel branch-and-bound algorithms for the set covering problem (Q1316095) (← links)
- The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems (Q1333026) (← links)
- An algorithm for the planar three-index assignment problem (Q1333481) (← links)
- A surrogate heuristic for set covering problems (Q1342046) (← links)
- Algorithms for railway crew management (Q1365052) (← links)
- Solving large set covering problems for crew scheduling (Q1367686) (← links)
- Graph theoretic relaxations of set covering and set partitioning problems (Q1390264) (← links)
- Delivering complex decision rules to top level managers through decision support systems: A case study in army housing management. (Q1406640) (← links)
- Hybrid heuristic algorithms for set covering. (Q1406642) (← links)
- Evaluation of reliability bounds by set covering models. (Q1424481) (← links)
- A parallel genetic algorithm to solve the set-covering problem (Q1603319) (← links)
- A concurrent processing framework for the set partitioning problem (Q1603333) (← links)
- The matching relaxation for a class of generalized set partitioning problems (Q1634772) (← links)
- A distance-limited continuous location-allocation problem for spatial planning of decentralized systems (Q1651515) (← links)
- An application-oriented guide for designing Lagrangean dual ascent algorithms (Q1824554) (← links)
- Lagrangean relaxation. (With comments and rejoinder). (Q1876461) (← links)
- A monotonic, dual-based bounding procedure for integer programs (Q1894724) (← links)
- A dual strategy for solving the linear programming relaxation of a driver scheduling system (Q1904740) (← links)
- Application of a hybrid genetic algorithm to airline crew scheduling (Q1915974) (← links)
- Tighter representations for set partitioning problems (Q1917353) (← links)
- A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems (Q1922639) (← links)
- Solving hard set covering problems (Q1924619) (← links)
- A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923) (← links)
- Efficient feature selection for logical analysis of large-scale multi-class datasets (Q2045033) (← 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)
- Solving the non-unicost set covering problem by using cuckoo search and black hole optimization (Q2311311) (← links)
- A set covering approach for multi-depot train driver scheduling (Q2343986) (← links)
- A simulated evolution-based solution of the cover problem (Q2391718) (← links)
- Humanitarian logistics planning for natural disaster response with Bayesian information updates (Q2438394) (← links)
