default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Operations Research, Volume 46-47
Volumes 46-47, Number 1, 1993
- Tomas Gal:
Foreword. - Tomas Gal:
Selected bibliography on degeneracy. 1-7 - Achiya Dax:
The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review. 9-60 - Anthony V. Fiacco, Jiming Liu:
Degeneracy in NLP and the development of results motivated by its presence. 61-80 - Tomas Gal:
Degeneracy graphs: theory and application an updated survey. 81-105 - Osman Güler, Dick den Hertog, Cornelis Roos, Tamás Terlaky
, Takashi Tsuchiya:
Degeneracy in interior point methods for linear programming: a survey. 107-138 - Ming S. Hung, Walter O. Rom, Allan D. Waren:
Combinatoric classes of the transportation problem and their properties. 139-156 - Zhi-Quan Luo, Paul Tseng:
Error bounds and convergence analysis of feasible descent methods: a general approach. 157-178 - S. R. Mohan:
Degeneracy in linear complementarity problems: a survey. 179-194 - Maria Niggemeier:
Degeneracy in integer linear optimization problems: A selected bibliography. 195-202 - Tamás Terlaky, Shuzhong Zhang:
Pivot rules for linear programming: A survey on recent theoretical developments. 203-233
Volumes 46-47, Number 2, 1993
- José C. Arantes, John R. Birge, Katta G. Murty:
Studies of lexicography in the generalized network simplex method. 235-248 - Paul Armand:
Bounds on the number of vertices of perturbed polyhedra. 249-269 - Abraham Charnes, John J. Rousseau, John H. Semple:
An effective non-Archimedean anti-degeneracy/cycling linear programming method especially for data envelopment analysis and like models. 271-278 - Jerald P. Dauer:
On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program. 279-292 - Michael C. Ferris, Olvi L. Mangasarian:
Error bounds and strong upper semicontinuity for monotone affine variational inequalities. 293-305 - R. Fletcher:
Resolving degeneracy in quadratic programming. 307-334 - Saul I. Gass:
Encounters with degeneracy: A personal view. 335-342 - Karen George, Michael R. Osborne:
On degeneracy in linear programming and related problems. 343-359 - Ferdinand Geue:
An improved N-tree algorithm for the enumeration of all neighbors of a degenerate vertex. 361-391 - Hermann-Josef Kruse:
On some properties of o-degeneracy graphs. 393-408 - S. A. Leichner, George B. Dantzig, J. W. Davis:
A strictly improving linear programming Phase I algorithm. 409-430 - István Maros:
A practical anti-degeneracy row selection technique in network linear programming. 431-442 - Renato D. C. Monteiro, Takashi Tsuchiya, Y. Wang:
A simplified global convergence proof of the affine scaling algorithm. 443-482 - Josef Nedoma:
Vague matrices in linear programming. 483-496 - Konstantinos Paparrizos:
An exterior point simplex algorithm for (general) linear programming problems. 497-508 - Takashi Tsuchiya:
Global convergence of the affine scaling algorithm for primal degenerate strictly convex quadratic programming problems. 509-539 - Peter Zörnig:
A theory of degeneracy graphs. 541-556 - Appreciation of referees' services. 557-558
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-06 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
