On identifying dominant cliques. (Q1811147): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Conflict graphs in solving integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a Truck Dispatching Scheduling Problem Using Branch-and-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 457: finding all cliques of an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Zero-One Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient reformulation for 0-1 programs -- methods and computational results / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates / rank
 
Normal rank
Property / cites work
 
Property / cites work: On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dioïds and semirings: Links to fuzzy sets and other applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A correction of the justification of the Dietrich-Escudero-Garín-Pérez O(n) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates / 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: Preprocessing and Probing Techniques for Mixed Integer Programming Problems / rank
 
Normal rank

Revision as of 17:30, 5 June 2024

scientific article
Language Label Description Also known as
English
On identifying dominant cliques.
scientific article

    Statements

    On identifying dominant cliques. (English)
    0 references
    10 June 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    Integer programming
    0 references
    Dominant cliques
    0 references
    Complete graphs
    0 references
    Tightening 0-1
    0 references
    models
    0 references
    0 references
    0 references
    0 references