An algorithm for disjunctive programs (Q1173796): Difference between revisions

From MaRDI portal
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: Correction to ''Disjunctive programming'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3904339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Algorithms: A Framework and State-of-the-Art Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling with integer variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4404428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization with disjunctive constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347628 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(90)90419-c / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2021947147 / rank
 
Normal rank

Latest revision as of 10:55, 30 July 2024

scientific article
Language Label Description Also known as
English
An algorithm for disjunctive programs
scientific article

    Statements

    An algorithm for disjunctive programs (English)
    0 references
    0 references
    25 June 1992
    0 references
    The standard solution technique for linear problems complicated by disjunctions is to re-express each disjunction in terms of binary variables and solve the resulting mixed integer problem. An algorithm based on the logical relationships among constraints is proposed and its advantages are shown.
    0 references
    0 references
    disjunctions
    0 references
    0 references
    0 references

    Identifiers

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