On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets (Q427901): 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.1016/j.dam.2012.02.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2030994187 / 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: 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: Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: When the Greedy Solution Solves a Class of Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cutting stock problem and integer rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4054818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong formulations for mixed integer programs: valid inequalities and extended formulations / rank
 
Normal rank

Latest revision as of 09:15, 5 July 2024

scientific article
Language Label Description Also known as
English
On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets
scientific article

    Statements

    On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets (English)
    0 references
    0 references
    18 June 2012
    0 references
    0 references
    \(n\)-step mixed integer rounding
    0 references
    partition inequality
    0 references
    integer knapsack set
    0 references
    capacitated flow set
    0 references
    valid inequality
    0 references
    facet
    0 references
    0 references