Computational experience with general cutting planes for the set covering problem (Q1002077): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Igor' Leonidovich Vasilyev / rank
Normal rank
 
Property / author
 
Property / author: Igor' Leonidovich Vasilyev / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Concorde / 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.orl.2008.09.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006346540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solutions to linear programming problems / 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 Heuristic Method for the Set Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms 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: On the 0,1 facets of the set covering polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing over the first Chvátal closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms to Separate ${\{0,\frac{1}{2}\}}$ -Chvátal-Gomory Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving hard set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets and lifting procedures for the set covering polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of the set covering polytope / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:38, 29 June 2024

scientific article
Language Label Description Also known as
English
Computational experience with general cutting planes for the set covering problem
scientific article

    Statements

    Computational experience with general cutting planes for the set covering problem (English)
    0 references
    0 references
    0 references
    23 February 2009
    0 references
    0 references
    set covering
    0 references
    cutting planes
    0 references
    exact separation
    0 references
    0 references