Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra (Q2390995): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-008-0216-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981753748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic group and knapsack facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities based on simple mixed-integer sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities based on the interpolation procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some polyhedra related to combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some continuous functions related to corner polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some continuous functions related to corner polyhedra, II / rank
 
Normal rank
Property / cites work
 
Property / cites work: T-space and cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corner polyhedra and their connection with cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation and Mixed Integer Rounding to Solve MIPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank

Latest revision as of 20:25, 1 July 2024

scientific article
Language Label Description Also known as
English
Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
scientific article

    Statements

    Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra (English)
    0 references
    0 references
    0 references
    24 July 2009
    0 references
    The authors generalize the mixed integer rounding strategy of S. Dash and O. Günlük or constraints in a mixed integer program. These inequalities can easily be produced by using periodic functions. Finally, the connection with infinite group polyhedra is discussed.
    0 references
    0 references
    0 references
    0 references
    0 references
    mixed integer programming
    0 references
    mixed integer rounding
    0 references
    valid inequalities, group polyhedra
    0 references
    0 references