Two general methods for inverse optimization problems (Q1808980): Difference between revisions
From MaRDI portal
Set profile property. |
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: An inverse problem of the weighted shortest path problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4716335 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Calculating some inverse linear programming problems / rank | |||
Normal rank |
Revision as of 10:45, 29 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Two general methods for inverse optimization problems |
scientific article |
Statements
Two general methods for inverse optimization problems (English)
0 references
25 November 1999
0 references
revised simplex method
0 references
column generation method
0 references
ellipsoid method
0 references
inverse optimization
0 references
uniform LP model
0 references