Enhancing an algorithm for set covering problems (Q1194745): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A network relaxation based enumeration algorithm for set partitioning / 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: On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for solving large capacitated warehouse location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4735035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Commodity Disconnecting Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Covering and Involutory Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Covering and Involutory Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplification of the Covering Problem with Application to Boolean Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-one programming using non-binary tree-search / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 0,1 facets of the set covering polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Column Generation Approach to the Urban Transit Crew Scheduling Problem / 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: An Integer Programming Approach to the Vehicle Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Political Districting by Implicit Enumeration Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5524189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5338603 / 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: An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the integer properties of scheduling set partitioning 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: On the facial structure of the set covering polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4077727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Scheduiing of Two Consecutive Idle Periods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Location of Emergency Service Facilities / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(92)90215-u / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033405689 / rank
 
Normal rank

Latest revision as of 08:26, 30 July 2024

scientific article
Language Label Description Also known as
English
Enhancing an algorithm for set covering problems
scientific article

    Statements

    Enhancing an algorithm for set covering problems (English)
    0 references
    0 references
    0 references
    6 October 1992
    0 references
    set covering
    0 references
    Lagrange heuristic
    0 references
    \(f\)-cuts
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers