Managing cost uncertainties in transportation and assignment problems.
Adlakha, V., Arsham, H. (1998)
Journal of Applied Mathematics and Decision Sciences
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “The Benders method and parametrization of the right-hand sides in the mixed integer linear programming problem”
Managing cost uncertainties in transportation and assignment problems.
On the conjecture relating minimax and minimean complexity norms
Peter Růžička, Juraj Wiedermann (1979)
Aplikace matematiky
Similarity:
Using counterexample it has been shown that an algorithm which is minimax optimal and over all minimax optimal algorithms is minimean optimal and has a uniform behaviour need not to be minimean optimal.
A Slight Modification of the First Phase of the Simplex Algorithm
T. Divnić, Lj. Pavlović (2012)
The Yugoslav Journal of Operations Research
Similarity:
On the acceleration of adaptation processes by two-step principles
Klaus Fritzsch (1977)
Kybernetika
Similarity:
A Projection Method for Linearly Constrained Problems Which Only Uses Function Values
Nada I. Đuranović-Miličić (1991)
The Yugoslav Journal of Operations Research
Similarity:
A Modified Step-Length Algorithm in Nonlinear Programming
Nada I. Žuranović-Miličić (2000)
The Yugoslav Journal of Operations Research
Similarity: