Sensitivity theorems in integer linear programming (Q3793940): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: William Cook / rank
Normal rank
 
Property / author
 
Property / author: Q162984 / rank
Normal rank
 
Property / author
 
Property / author: William Cook / rank
 
Normal rank
Property / author
 
Property / author: Alexander Schrijver / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The value function of a mixed integer program: I / rank
 
Normal rank
Property / cites work
 
Property / cites work: The value function of a mixed integer program. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The value function of an integer program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet Generating Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edmonds polytopes and a hierarchy of combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edmonds polytopes and weakly hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of cutting-plane proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bound on Solutions of Linear Integer Equalities and Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrices with the Edmonds-Johnson property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total dual integrality and integer polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5645210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some polyhedra related to combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the foundations of linear and integer linear programming I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3329225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Linear Characterizations of Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4742548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On total dual integrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5603731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The b-hull of an integer program / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:03, 18 June 2024

scientific article
Language Label Description Also known as
English
Sensitivity theorems in integer linear programming
scientific article

    Statements

    Sensitivity theorems in integer linear programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1986
    0 references
    fixed coefficient matrices
    0 references
    varying objective functions
    0 references
    nearest optimal solution
    0 references
    Chvátal rank
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references