Cutting plane algorithms for the inverse mixed integer linear programming problem (Q1015310): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On an instance of the inverse shortest paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two general methods for inverse optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse combinatorial optimization: a survey on problems, methods, and results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Applications in Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse conic programming with applications / 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: MIPLIB 2003 / rank
 
Normal rank

Revision as of 13:55, 1 July 2024

scientific article
Language Label Description Also known as
English
Cutting plane algorithms for the inverse mixed integer linear programming problem
scientific article

    Statements

    Cutting plane algorithms for the inverse mixed integer linear programming problem (English)
    0 references
    0 references
    7 May 2009
    0 references
    inverse optimization
    0 references
    mixed integer linear programming
    0 references
    0 references
    0 references

    Identifiers