A surrogate heuristic for set covering problems (Q1342046): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Luiz Antonio Nogueira Lorena / rank
Normal rank
 
Property / author
 
Property / author: Luiz Antonio Nogueira Lorena / 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/0377-2217(94)90401-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2073316024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Polyak's convergence result for subgradient optimization / 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: Q3048579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the choice of step size in subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4735035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Gradients and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—A Computational Survey of Methods for the Set Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete-Variable Extremum Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact methods for the knapsack problem and its generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculating surrogate constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the solution of the 0-1 knapsack 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: An Integer Programming Approach to the Vehicle Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A descent algorithm for nonsmooth convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>m</i>-Center Problem: Minimax Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Set-Partitioning Problem: Set Covering with Equality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convergence rates of subgradient optimization methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Generalized Penalty-Function/Surrogate Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / 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: Surrogate Dual Multiplier Search Procedures in Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An aggregate subgradient method for nonsmooth convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Set Partitioning Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3750525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of unsmooth functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Way to Simplify Truth Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Private and Public Sector Location Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Covering by an All Integer Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3804448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4733672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4880749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient heuristic for large set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving large set covering problems on a personal computer / rank
 
Normal rank

Latest revision as of 11:19, 23 May 2024

scientific article
Language Label Description Also known as
English
A surrogate heuristic for set covering problems
scientific article

    Statements

    A surrogate heuristic for set covering problems (English)
    0 references
    11 January 1995
    0 references
    0 references
    heuristic
    0 references
    set covering
    0 references
    continuous surrogate relaxations
    0 references
    subgradient optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references