Pascal and Francis Bibliographic Databases

Help

Search results

Your search

is.\*:("0025-5610")

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

Author Country

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

Results 1 to 25 of 1545

  • Page / 62
Export

Selection :

  • and

A FPTAS for computing a symmetric Leontief competitive economy equilibriumZHISU ZHU; CHUANGYIN DANG; YINYU YE et al.Mathematical programming (Print). 2012, Vol 131, Num 1-2, pp 113-129, issn 0025-5610, 17 p.Article

A line search exact penalty method using steering rulesBYRD, Richard H; LOPEZ-CALVA, Gabriel; NOCEDAL, Jorge et al.Mathematical programming (Print). 2012, Vol 133, Num 1-2, pp 39-73, issn 0025-5610, 35 p.Article

A ranking model for the greedy algorithm and discrete convexityFAIGLE, Ulrich; KERN, Walter; PEIS, Britta et al.Mathematical programming (Print). 2012, Vol 132, Num 1-2, pp 393-407, issn 0025-5610, 15 p.Article

Alternatives for testing total dual integralityO'SHEA, Edwin; SEBÖ, András.Mathematical programming (Print). 2012, Vol 132, Num 1-2, pp 57-78, issn 0025-5610, 22 p.Article

An implementable proximal point algorithmic framework for nuclear norm minimizationLIU, Yong-Jin; DEFENG SUN; TOH, Kim-Chuan et al.Mathematical programming (Print). 2012, Vol 133, Num 1-2, pp 399-436, issn 0025-5610, 38 p.Article

An optimal method for stochastic composite optimizationGUANGHUI LAN.Mathematical programming (Print). 2012, Vol 133, Num 1-2, pp 365-397, issn 0025-5610, 33 p.Article

Binary positive semidefinite matrices and associated integer polytopesLETCHFORD, Adam N; SØRENSEN, Michael M.Mathematical programming (Print). 2012, Vol 131, Num 1-2, pp 253-271, issn 0025-5610, 19 p.Article

Clique-based facets for the precedence constrained knapsack problemBOLAND, Natashia; BLEY, Andreas; FRICKE, Christopher et al.Mathematical programming (Print). 2012, Vol 133, Num 1-2, pp 481-511, issn 0025-5610, 31 p.Article

Constraint augmentation in pseudo-singularly perturbed linear programsAVRACHENKOV, K; BURACHIK, R. S; FILAR, J. A et al.Mathematical programming (Print). 2012, Vol 132, Num 1-2, pp 179-208, issn 0025-5610, 30 p.Article

Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regressionZHAOSONG LU; MONTEIRO, Renato D. C; MING YUAN et al.Mathematical programming (Print). 2012, Vol 131, Num 1-2, pp 163-194, issn 0025-5610, 32 p.Article

Graph realizations associated with minimizing the maximum eigenvalue of the LaplacianGORING, Frank; HELMBERG, Christoph; REISS, Susanna et al.Mathematical programming (Print). 2012, Vol 131, Num 1-2, pp 95-111, issn 0025-5610, 17 p.Article

Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programmingYAMASHITA, Hiroshi; YABE, Hiroshi.Mathematical programming (Print). 2012, Vol 132, Num 1-2, pp 1-30, issn 0025-5610, 30 p.Article

Monotonicity of Lowner operators and its applications to symmetric cone complementarity problemsLINGCHEN KONG; TUNCEL, Levent; NAIHUA XIU et al.Mathematical programming (Print). 2012, Vol 133, Num 1-2, pp 327-336, issn 0025-5610, 10 p.Article

The hardness of routing two pairs on one faceNAVES, Guyslain.Mathematical programming (Print). 2012, Vol 131, Num 1-2, pp 49-69, issn 0025-5610, 21 p.Article

A convex polynomial that is not sos-convexAMIR ALI AHMADI; PARRILO, Pablo A.Mathematical programming (Print). 2012, Vol 135, Num 1-2, pp 275-292, issn 0025-5610, 18 p.Article

A relaxed constant positive linear dependence constraint qualification and applicationsANDREANI, Roberto; HAESER, Gabriel; SCHUVERDT, Maria Laura et al.Mathematical programming (Print). 2012, Vol 135, Num 1-2, pp 255-273, issn 0025-5610, 19 p.Article

Cone superadditivity of discrete convex functionsKOBAYASHI, Yusuke; MUROTA, Kazuo; WEISMANTEL, Robert et al.Mathematical programming (Print). 2012, Vol 135, Num 1-2, pp 25-44, issn 0025-5610, 20 p.Article

Structural and algorithmic properties for parametric minimum cutsGRANOT, Frieda; MCCORMICK, S. Thomas; QUEYRANNE, Maurice et al.Mathematical programming (Print). 2012, Vol 135, Num 1-2, pp 337-367, issn 0025-5610, 31 p.Article

The static stochastic knapsack problem with normally distributed item sizesMERZIFONLUOGLU, Yasemin; GEUNES, Joseph; ROMEIJN, H. Edwin et al.Mathematical programming (Print). 2012, Vol 134, Num 2, pp 459-489, issn 0025-5610, 31 p.Article

Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedraDASH, Sanjeeb; DEY, Santanu S; GIINLIIK, Oktay et al.Mathematical programming (Print). 2012, Vol 135, Num 1-2, pp 221-254, issn 0025-5610, 34 p.Article

Vectors in a boxBUCHIN, Kevin; MATOUSEK, Jiří; MOSER, Robin A et al.Mathematical programming (Print). 2012, Vol 135, Num 1-2, pp 323-335, issn 0025-5610, 13 p.Article

Special issue of the ISMP 2012 BerlinHINTERMÜLLER, Michael; SKUTELLA, Martin.Mathematical programming (Print). 2012, Vol 134, Num 1, issn 0025-5610, 324 p.Conference Proceedings

A storm of feasibility pumps for nonconvex MINLPD'AMBROSIO, Claudia; FRANGIONI, Antonio; LIBERTI, Leo et al.Mathematical programming (Print). 2012, Vol 136, Num 2, pp 375-402, issn 0025-5610, 28 p.Conference Paper

Computation of sparse low degree interpolating polynomials and their application to derivative-free optimizationBANDEIRA, A. S; SCHEINBERG, K; VICENTE, L. N et al.Mathematical programming (Print). 2012, Vol 134, Num 1, pp 223-257, issn 0025-5610, 35 p.Conference Paper

Optimization and mechanism designVOHRA, Rakesh V.Mathematical programming (Print). 2012, Vol 134, Num 1, pp 283-303, issn 0025-5610, 21 p.Conference Paper

  • Page / 62