Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Méthode primale duale")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 788

  • Page / 32
Export

Selection :

  • and

On minimum norm solutionsDAX, A.Journal of optimization theory and applications. 1993, Vol 76, Num 1, pp 183-193, issn 0022-3239Article

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

Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programsSHERALI, H. D; CHOI, G.Operations research letters. 1996, Vol 19, Num 3, pp 105-113, issn 0167-6377Article

Optimally criteria for general unconstrained geometric programming problemsILLES, T.Computers & mathematics with applications (1987). 1991, Vol 21, Num 1, pp 103-110, issn 0898-1221, 8 p.Article

On the resemblance between the Kornai-Liptak and cross decomposition techniques for block-angular linear programsAARDAL, K; AYSEN ARI.European journal of operational research. 1990, Vol 46, Num 3, pp 393-398, issn 0377-2217, 6 p.Article

A primal-dual approximation algorithm for the Steiner forest problemRAVI, R.Information processing letters. 1994, Vol 50, Num 4, pp 185-189, issn 0020-0190Article

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

A primal-dual algorithm for online non-uniform facility locationFOTAKIS, Dimitris.Lecture notes in computer science. 2005, pp 47-56, issn 0302-9743, isbn 3-540-29673-5, 1Vol, 10 p.Conference Paper

Edge pricing of multicommodity networks for heterogeneous selfish usersKARAKOSTAS, George; KOLLIOPOULOS, Stavros G.Annual Symposium on Foundations of Computer Science. 2004, pp 268-276, isbn 0-7695-2228-9, 1Vol, 9 p.Conference Paper

A primal-dual infeasible-interior-point algorithm for linear semi-infinite programmingSHEU, R.-L; WU, S.-Y; FANG, S.-C et al.Computers & mathematics with applications (1987). 1995, Vol 29, Num 8, pp 7-18, issn 0898-1221Article

A note on bounding a class of linear programming problems, including cutting stock problemsFARLEY, A. A.Operations research. 1990, Vol 38, Num 5, pp 922-923, issn 0030-364XArticle

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 pseudopolynomial network flow formulation for exact knapsack separationANDREW BOYD, E.Networks (New York, NY). 1992, Vol 22, Num 5, pp 503-514, issn 0028-3045Article

Probabilistic constraints in primal and dual linear programs : duality resultsKOMAROMI, E.Journal of optimization theory and applications. 1992, Vol 75, Num 3, pp 587-602, issn 0022-3239Article

Fast primal and dual heuristics for the p-median location problemEUGENIA CAPTIVO, M.European journal of operational research. 1991, Vol 52, Num 1, pp 65-74, issn 0377-2217Article

A Tale of Two MethodsBAR-YEHUDA, Reuven; RAWITZ, Dror.Theoretical computer science (essays in memory of Shimon Even). Lecture notes in computer science. 2006, pp 196-217, issn 0302-9743, isbn 3-540-32880-7, 1Vol, 22 p.Book Chapter

Approximation and on-line algorithmsLEONARDI, Stefano.Algorithmica. 2004, Vol 40, Num 4, issn 0178-4617, 113 p.Serial Issue

A characterization of ill-posed data instances for convex programmingNUNEZ, Manuel A.Mathematical programming. 2002, Vol 91, Num 2, pp 375-390, issn 0025-5610Article

  • Page / 32