A Heuristic Method for the Set Covering Problem
From MaRDI portal
Publication:4950819
DOI10.1287/opre.47.5.730zbMath0976.90086OpenAlexW2099813847MaRDI QIDQ4950819
Paolo Toth, Alberto Caprara, Matteo Fischetti
Publication date: 13 January 2002
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.47.5.730
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
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, The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation, On some difficult linear programs coming from set partitioning, Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem, An efficient local search heuristic with row weighting for the unicost set covering problem, AN EFFICIENT AND PRACTICALLY ROBUST HYBRID METAHEURISTIC ALGORITHM FOR SOLVING FUZZY BUS TERMINAL LOCATION PROBLEMS, An effective and simple heuristic for the set covering problem, Set covering with almost consecutive ones property, Generating, scheduling and rostering of shift crew-duties: applications at the Hong Kong international airport, Column generation based heuristic for tactical planning in multi-period vehicle routing, A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering, Tactical fixed job scheduling with spread-time constraints, 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, Algorithms for railway crew management, Robust min-max regret covering problems, A column generation approach for the rail crew re-scheduling problem, A theoretical justification of the set covering greedy heuristic of Caprara et al., A hybrid heuristic for the set covering problem, A GRASP algorithm to solve the unicost set covering problem, Spectral projected subgradient with a momentum term for the Lagrangean dual approach, Cyclic preference scheduling of nurses using a Lagrangian-based heuristic, Some heuristic methods for solving \(p\)-median problems with a coverage constraint, Solving a multi-objective interval crew-scheduling problem via genetic algorithms, Optimizing word set coverage for multi-event summarization, 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, The Impact of a New Formulation When Solving the Set Covering Problem Using the ACO Metaheuristic, Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs, A binary monkey search algorithm variation for solving the set covering problem, Thinning out Steiner trees: a node-based model for uniform edge costs, Adaptive feasible and infeasible tabu search for weighted vertex coloring, A Lagrangian relaxation approach to an electricity system investment model with a high temporal resolution, An exact approach for the vertex coloring problem, Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems, Exact weighted vertex coloring via branch-and-price, Deadlock analysis and control using Petri net decomposition techniques, An evolutionary and constructive approach to a crew scheduling problem in underground passenger transport, 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, A Nested Decomposition Approach for a Large Scale Set Covering Problem: A Model with a Variety of Applications in Industry 4.0, Natalie 2.0: sparse global network alignment as a special case of quadratic assignment, A survey on vertex coloring problems, A relax-and-cut algorithm for the set partitioning problem, Constrained 0-1 quadratic programming: basic approaches and extensions, An improved configuration checking-based algorithm for the unicost set covering problem, An algorithm for approximating the Pareto set of the multiobjective set covering problem, A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem, Real-time vehicle rerouting problems with time windows, A LAD-based method for selecting short oligo probes for genotyping applications, 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 graph partitioning strategy for solving large-scale crew scheduling problems, A 3-flip neighborhood local search for the set covering problem, Surrogate constraint normalization for the set covering problem, An electromagnetism metaheuristic for the unicost set covering problem, Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems, A SAT approach to query optimization in mediator systems, A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation, Railway crew scheduling: models, methods and applications, Computational experience with general cutting planes for the set covering problem, The set covering problem revisited: an empirical study of the value of dual information, Efficient feature selection for logical analysis of large-scale multi-class datasets, A Lagrangian relaxation approach for the multiple sequence alignment problem, THE CONTINUOUS STOP LOCATION PROBLEM IN PUBLIC TRANSPORTATION NETWORKS, Heuristics for the variable sized bin-packing problem, On the Number and Arrangement of Sensors for the Multiple Covering of Bounded Plane Domains, Solving the non-unicost set covering problem by using cuckoo search and black hole optimization, Models and heuristic algorithms for a weighted vertex coloring 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, The train driver recovery problem-a set partitioning based model and solution method, A set covering based matheuristic for a real‐world city logistics problem, A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles, An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem, A set covering approach for multi-depot train driver scheduling, Column generation extensions of set covering greedy heuristics, Convergence analysis for the modified spectral projected subgradient method, Locating stops along bus or railway lines -- a bicriteria problem
