A converse for disjunctive constraints (Q1238749): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting-planes for programs with disjunctive constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4120330 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengthening cuts for mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5603731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trivial integer programs unsolvable by branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral annexation in mixed integer and combinatorial programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concave Programming Applied to a Special Class of 0-1 Integer Programs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf00933212 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2062809736 / rank
 
Normal rank

Latest revision as of 11:10, 30 July 2024

scientific article
Language Label Description Also known as
English
A converse for disjunctive constraints
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references