Surrogate constraint normalization for the set covering problem (Q976352): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jose Humberto Ablanedo-Rosas / rank
Normal rank
 
Property / author
 
Property / author: Jose Humberto Ablanedo-Rosas / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: RAMP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2010.02.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2155693170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptation of SH heuristic to the location set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on some computationally difficult set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Method for the Set Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian-based heuristic for large-scale set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculating surrogate constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic heuristic for a computationally difficult set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Constraints in Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Constraint Duality in Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tutorial on surrogate constraint approaches for optimization in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A set covering reformulation of the pure fixed charge transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with approximation algorithms for the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Lagrangian heuristic for the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A neural network for the minimum set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4704222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Surrogate Constraints in a Lagrangian Relaxation Approach to Set-Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering heuristics for set covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A surrogate heuristic for set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithms applied to computationally difficult set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Few statistical tests for proportions comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving large set covering problems on a personal computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a facility location algorithm to solve large set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient heuristic for large set covering problems / rank
 
Normal rank

Latest revision as of 22:43, 2 July 2024

scientific article
Language Label Description Also known as
English
Surrogate constraint normalization for the set covering problem
scientific article

    Statements

    Surrogate constraint normalization for the set covering problem (English)
    0 references
    0 references
    11 June 2010
    0 references
    0 references
    surrogate constraints
    0 references
    constraint normalization
    0 references
    set covering problem
    0 references
    greedy knapsack heuristic
    0 references
    heuristics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references