Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs (Q3656864): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Crown structures for vertex cover kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable parallel algorithms for FPT problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for finding embedded network structure in mathematical programmes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A good submatrix is hard to find / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Edge Deletions for Signed Graph Balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Converting Linear Programs to Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic identification of embedded network rows in large-scale optimization models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic and Complexity Results for Decompositions of Biological Networks into Monotone Subsystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting embedded networks in LP using GUB structures and independent set algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting pure network submatrices in linear programs using signed graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple algorithm to detect balance in signed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Inequalities and Related Systems. (AM-38) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Engineering for Optimal Graph Bipartization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of Renameable Horn Backdoors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \((\Delta / 2)\)-approximation algorithm for the maximum independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost 2-SAT is fixed-parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding odd cycle transversals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signed graphs / rank
 
Normal rank

Latest revision as of 09:36, 2 July 2024

scientific article
Language Label Description Also known as
English
Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs
scientific article

    Statements

    Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs (English)
    0 references
    0 references
    0 references
    0 references
    14 January 2010
    0 references
    0 references
    0 references