Valid Inequalities and Separation Algorithms for the Set Partitioning Problem (Q6160432): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the separation of maximally violated mod-\(k\) cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint handling in genetic algorithms: the set partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edmonds polytopes and a hierarchy of combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Aggregation of Set-Partitioning Constraints in Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Airline Crew Scheduling Problems by Branch-and-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / 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: A new modeling and solution approach for the set-partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of set packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Minimum Cut-Sets and <i>b</i>-Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integral simplex algorithm for solving combinatorial optimization problems / rank
 
Normal rank

Revision as of 03:19, 1 August 2024

scientific article; zbMATH DE number 7683744
Language Label Description Also known as
English
Valid Inequalities and Separation Algorithms for the Set Partitioning Problem
scientific article; zbMATH DE number 7683744

    Statements

    Valid Inequalities and Separation Algorithms for the Set Partitioning Problem (English)
    0 references
    0 references
    0 references
    0 references
    9 May 2023
    0 references
    set partitioning
    0 references
    cutting planes
    0 references
    rank-1 Chvátal-Gomory inequalities
    0 references
    clique
    0 references
    separation algorithm
    0 references
    0 references

    Identifiers