A Heuristic Method for the Set Covering Problem
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Computational experience with general cutting planes for the set covering problem
- A Lagrangian relaxation approach for the multiple sequence alignment problem
- Heuristics for the variable sized bin-packing problem
- Models and heuristic algorithms for a weighted vertex coloring problem
- The train driver recovery problem-a set partitioning based model and solution method
- Pick-and-choose heuristics for partial set covering
- Simple Lagrangian heuristic for the set covering problem
- A Lagrangian-based heuristic for large-scale set covering problems
- Algorithms for large scale set covering problems
- The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
- A surrogate heuristic for set covering problems
- On some difficult linear programs coming from set partitioning
- Algorithms for railway crew management
- Solving large set covering problems for crew scheduling
- A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles
- The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation
- A distance-limited continuous location-allocation problem for spatial planning of decentralized systems
- Relaxation heuristics for the set multicover problem with generalized upper bound constraints
- Modified spectral projected subgradient method: convergence analysis and momentum parameter heuristics
- Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
- Thinning out Steiner trees: a node-based model for uniform edge costs
- Synthetic optimization model and algorithm for railway freight center station location and wagon flow organization problem
- A tolerance function for the multiobjective set covering problem
- Natalie 2.0: sparse global network alignment as a special case of quadratic assignment
- A computational study of a nonlinear minsum facility location problem
- An aggregation heuristic for large scale p-median problem
- A relax-and-cut framework for Gomory mixed-integer cuts
- A SAT approach to query optimization in mediator systems
- An algorithm for set covering problem
- Some heuristic methods for solving p-median problems with a coverage constraint
- Solving a multi-objective interval crew-scheduling problem via genetic algorithms
- An evolutionary and constructive approach to a crew scheduling problem in underground passenger transport
- A procedure for solution of the problem of optimal covering of a finite set
- A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem
- Efficient feature selection for logical analysis of large-scale multi-class datasets
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
- Column generation extensions of set covering greedy heuristics
- Robust min-max regret covering problems
- A theoretical justification of the set covering greedy heuristic of Caprara et al.
- Adaptive feasible and infeasible tabu search for weighted vertex coloring
- A two-phase heuristic for set covering
- Deadlock analysis and control using Petri net decomposition techniques
- An improved configuration checking-based algorithm for the unicost set covering problem
- A graph partitioning strategy for solving large-scale crew scheduling problems
- Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems
- Railway crew scheduling: models, methods and applications
- Solving the non-unicost set covering problem by using cuckoo search and black hole optimization
- A set covering approach for multi-depot train driver scheduling
- Convergence analysis for the modified spectral projected subgradient method
- New heuristics for the conditional covering problem
- Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem
- Set covering with almost consecutive ones property
- A relax-and-cut algorithm for the set partitioning problem
- Constrained 0-1 quadratic programming: basic approaches and extensions
- A LAD-based method for selecting short oligo probes for genotyping applications
- A 3-flip neighborhood local search for the set covering problem
- The set covering problem revisited: an empirical study of the value of dual information
- Column generation based heuristic for tactical planning in multi-period vehicle routing
- An efficient and practically robust hybrid metaheuristic algorithm for solving fuzzy bus terminal location problems
- A survey on vertex coloring problems
- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
- An efficient local search heuristic with row weighting for the unicost set covering problem
- A nested decomposition approach for a large scale set covering problem: a model with a variety of applications in Industry 4.0
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering
- Tactical fixed job scheduling with spread-time constraints
- scientific article; zbMATH DE number 4160470 (Why is no real title available?)
- THE CONTINUOUS STOP LOCATION PROBLEM IN PUBLIC TRANSPORTATION NETWORKS
- A hybrid heuristic for the set covering problem
- Two methods of ordering the covering elements for the solution of the set covering problem
- An exact approach for the vertex coloring problem
- Ad hoc heuristic for the cover printing problem
- Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems
- Exact weighted vertex coloring via branch-and-price
- A heuristic algorithm for the set covering problem
- scientific article; zbMATH DE number 4121754 (Why is no real title available?)
- Note: A local-search heuristic for large set-covering problems
- On the number and arrangement of sensors for the multiple covering of bounded plane domains
- An algorithm for approximating the Pareto set of the multiobjective set covering problem
- A set covering based matheuristic for a real-world city logistics problem
- The impact of a new formulation when solving the set covering problem using the ACO metaheuristic
- RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- A scheme for determining vehicle routes based on Arc-based service network design
- Approximating the Pareto frontier for a challenging real-world bi-objective covering problem
- Algorithms for the set covering problem
- Matheuristics: survey and synthesis
- Solving Steiner trees: Recent advances, challenges, and perspectives
- Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities
- A binary monkey search algorithm variation for solving the set covering problem
- A Lagrangian relaxation approach to an electricity system investment model with a high temporal resolution
- Tilted inequalities and facets of the set covering polytope: a theoretical analysis
- A meta-heuristic extension of the Lagrangian heuristic framework
- An optimal algorithm for variable knockout problems
- An exact algorithm for the minimum gap graph partitioning problem
- Experiments with LAGRASP heuristic for set \(k\)-covering
- A meta-heuristic with orthogonal experiment for the set covering problem
- The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory
- Exploring further advantages in an alternative formulation for the set covering problem
- Locating stops along bus or railway lines -- a bicriteria problem
- An effective and simple heuristic for the set covering problem
- Generating, scheduling and rostering of shift crew-duties: applications at the Hong Kong international airport
This page was built for publication: A Heuristic Method for the Set Covering Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4950819)
