Generalized primal-relaxed dual approach for global optimizationLIU, W. B; FLOUDAS, C. A.Journal of optimization theory and applications. 1996, Vol 90, Num 2, pp 417-434, issn 0022-3239Article

An incremental primal-dual method for generalized networksCURET, N. D.Computers & operations research. 1994, Vol 21, Num 10, pp 1051-1059, issn 0305-0548Article

A primal-dual approach to approximation of node-deletion problems for matroidal propertiesFUJITO, T.Lecture notes in computer science. 1997, pp 749-759, issn 0302-9743, isbn 3-540-63165-8Conference Paper

New Trends in Optimization and Computational Algorithms (INTOC2001)KONNO, Hiroshi; TSUCHIYA, Takashi.Mathematical programming. 2003, Vol 97, Num 3, issn 0025-5610, 175 p.Conference Proceedings

A constant-factor approximation algorithm for the multicommodity rent-or-buy problemKUMAR, Amit; GUPTA, Anupam; ROUGHGARDEN, Tim et al.Annual Symposium on Foundations of Computer Science. 2002, pp 333-342, isbn 0-7695-1822-2, 10 p.Conference Paper

Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computationMIZUNO, S; JARRE, F.Mathematical programming. 1999, Vol 84, Num 1, pp 105-122, issn 0025-5610Article

Johri's general dual, the Lagrangian dual, and the surrogate dualNIEUWENHUIZEN, T.European journal of operational research. 1999, Vol 117, Num 1, pp 183-196, issn 0377-2217Article

On the condition numbers for polyhedra in Karmarkar's formTUNCEL, L.Operations research letters. 1999, Vol 24, Num 4, pp 149-155, issn 0167-6377Article

A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programmingMONTEIRO, R. D. C; YIN ZHANG.Mathematical programming. 1998, Vol 81, Num 3, pp 281-299, issn 0025-5610Article

Finite convergence of the partial inverse algorithmDALDOUL, M.Journal of optimization theory and applications. 1997, Vol 95, Num 3, pp 693-699, issn 0022-3239Article

A Simple Method for Improving the Primal Simplex Method for the Multicommodity Flow ProblemBOMPADRE, Aqustin; ORLIN, James B.Networks (New York, NY). 2008, Vol 51, Num 1, pp 63-77, issn 0028-3045, 15 p.Article

A proximal solution for a class of extended minimax location problemCORNEJO, Oscar; MICHELOT, Cristian.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-25860-4, 4Vol, part IV, 712-721Conference Paper

Algorithms for source-to-all maximum cost-to-time ratio problem in acyclic networksMAKRI, Alexandra; KLABIAN, Diego.Networks (New York, NY). 2003, Vol 42, Num 1, pp 1-14, issn 0028-3045, 14 p.Article

New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd directionPENG, J; ROOS, C; TERLAKY, T et al.Journal of optimization theory and applications. 2001, Vol 109, Num 2, pp 327-343, issn 0022-3239Article

Investigation of path-following algorithms for signomial geometric programming problemsYANG, H.-H; BRICKER, D. L.European journal of operational research. 1997, Vol 103, Num 1, pp 230-241, issn 0377-2217Article

An O(√nL) iteration bound primal-dual cone affine scaling algorithm for linear programmingSTURM, J. F; ZHANG, S.Mathematical programming. 1996, Vol 72, Num 2, pp 177-194, issn 0025-5610Article

Condition numbers for polyhedra with real number dataVAVASIS, S. A; YINYU YE.Operations research letters. 1995, Vol 17, Num 5, pp 209-214, issn 0167-6377Article

A multiobjective interior primal-dual linear programming algorithmARBEL, A.Computers & operations research. 1994, Vol 21, Num 4, pp 433-445, issn 0305-0548Article

The simplex algorithm with a new primal and dual pivot ruleHSIN-DER CHEN; PARDALOS, P. M; SAUNDERS, M. A et al.Operations research letters. 1994, Vol 16, Num 3, pp 121-127, issn 0167-6377Article

Finding an interior point in the optimal face of linear programsMEHROTRA, S; YINYU YE.Mathematical programming. 1993, Vol 62, Num 3, pp 497-515, issn 0025-5610Article

Theoretical relations between domain decomposition and dynamic substructuringRIXEN, Daniel J.Lecture notes in computer science. 2006, pp 342-348, issn 0302-9743, isbn 3-540-29067-2, 1Vol, 7 p.Conference Paper

Enumerating maximal frequent sets using irredundant dualizationSATOH, Ken; UNO, Takeaki.Lecture notes in computer science. 2003, pp 256-268, issn 0302-9743, isbn 3-540-20293-5, 13 p.Conference Paper

On multiroute maximum flows in networksAGGARWAL, Charu C; ORLIN, James B.Networks (New York, NY). 2002, Vol 39, Num 1, pp 43-52, issn 0028-3045Article

Permutation problems and channelling constraintsWALSH, Toby.Lecture notes in computer science. 2001, pp 377-391, issn 0302-9743, isbn 3-540-42957-3Conference Paper

A primal-dual approximation algorithm for the survivable network design problem in hypergraphLIANG ZHAO; NAGAMOCHI, Hiroshi; IBARAKI, Toshihide et al.Lecture notes in computer science. 2001, pp 478-489, issn 0302-9743, isbn 3-540-41695-1Conference Paper