Resolving degeneracy in combinatorial linear programs: Steepest edge, steepest ascent, and parametric ascent
- 期刊名称Mathematical Programming
- 作者E. Andrew Boyd
- 卷第68卷
- 印刷ISSN0025-5610
- 电子ISSN1436-4646
- 文件大小990.29KB
- 发表时间1995-01-2
- DOI10.1007/bf01585762
- 页码155-168
同期刊推荐
Fully copositive matricesG. S. R. Murthy; T. Parthasarathy · Mathematical Programming · 1998
Election of CouncilMathematical Programming · 1973
Editorial policyMathematical Programming · 1973
The Mathematical Programming SocietyMathematical Programming · 1973
A linear max—min problemJames E. Falk · Mathematical Programming · 1973
Unconstrained optimization based on homogeneous modelsChristakis Charalambous · Mathematical Programming · 1973
Computable error bounds for nonlinear programmingStephen M. Robinson · Mathematical Programming · 1973
Book reviewW. F. Lucas · Mathematical Programming · 1973