Pascal and Francis Bibliographic Databases

Help

Search results

Your search

jo.\*:("Mathematical programming")

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 2382

  • Page / 96
Export

Selection :

  • and

Approximation algorithms for general packing problems and their application to the multicast congestion problemJANSEN, Klaus; HU ZHANG.Mathematical programming. 2008, Vol 114, Num 1, pp 183-206, issn 0025-5610, 24 p.Article

Clique-circulants and the stable set polytope of fuzzy circular interval graphsORIOLO, Gianpaolo; STAUFFER, Gautier.Mathematical programming. 2008, Vol 115, Num 2, pp 291-317, issn 0025-5610, 27 p.Article

FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimensionDE LOERA, Jesus A; HEMMECKE, Raymond; KÖPPE, Matthias et al.Mathematical programming. 2008, Vol 115, Num 2, pp 273-290, issn 0025-5610, 18 p.Article

How good are interior point methods? Klee-Minty cubes tighten iteration-complexity boundsDEZA, Antoine; NEMATOLLAHI, Eissa; TERLAKY, Tamas et al.Mathematical programming. 2008, Vol 113, Num 1, pp 1-14, issn 0025-5610, 14 p.Article

On the strength of Gomory mixed-integer cuts as group cutsDASH, Sanjeeb; GÜNLÜK, Oktay.Mathematical programming. 2008, Vol 115, Num 2, pp 387-407, issn 0025-5610, 21 p.Article

Optimal Jacobian accumulation is NP-completeNAUMANN, Uwe.Mathematical programming. 2008, Vol 112, Num 2, pp 427-441, issn 0025-5610, 15 p.Article

Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulationUCHOA, Eduardo; FUKASAWA, Ricardo; LYSGAARD, Jens et al.Mathematical programming. 2008, Vol 112, Num 2, pp 443-472, issn 0025-5610, 30 p.Article

ISMP 2006IUSEM, Alfredo N; LUCENA, Abilio; MACULAN, Nelson et al.Mathematical programming. 2008, Vol 112, Num 1, issn 0025-5610, 272 p.Conference Proceedings

A path to the Arrow-Debreu competitive market equilibriumYINYU YE.Mathematical programming. 2008, Vol 111, Num 1-2, pp 315-348, issn 0025-5610, 34 p.Conference Paper

Continuous optimization methods for structure alignmentsANDREANI, Roberto; MARTINEZ, José Mario; MARTINEZ, Leandro et al.Mathematical programming. 2008, Vol 112, Num 1, pp 93-124, issn 0025-5610, 32 p.Conference Paper

Invariance and efficiency of convex representationsCHEK BENG CHUA; TUNNEL, Levent.Mathematical programming. 2008, Vol 111, Num 1-2, pp 113-140, issn 0025-5610, 28 p.Conference Paper

On some properties and an application of the logarithmic barrier methodBURACHIK, Regina S; GRANA DRUMMOND, L. M; SCHEIMBERG, Susana et al.Mathematical programming. 2008, Vol 111, Num 1-2, pp 95-112, issn 0025-5610, 18 p.Conference Paper

Submodular function minimizationIWATA, Satoru.Mathematical programming. 2008, Vol 112, Num 1, pp 45-64, issn 0025-5610, 20 p.Conference Paper

Computational study of large-scale p-Median problemsAVELLA, Pasquale; SASSANO, Antonio; VASIL'EV, Igor et al.Mathematical programming. 2007, Vol 109, Num 1, pp 89-114, issn 0025-5610, 26 p.Article

Equilibria for networks with malicious usersKARAKOSTAS, George; VIGLAS, Anastasios.Mathematical programming. 2007, Vol 110, Num 3, pp 591-613, issn 0025-5610, 23 p.Article

Mesh shape-quality optimization using the inverse mean-ratio metricMUNSON, Todd.Mathematical programming. 2007, Vol 110, Num 3, pp 561-590, issn 0025-5610, 30 p.Article

Quadratic programming and combinatorial minimum weight product problemsKERN, Walter; WOEGINGER, Gerhard.Mathematical programming. 2007, Vol 110, Num 3, pp 641-649, issn 0025-5610, 9 p.Article

Large-scale nonlinear and semidefinite programmingANDERSEN, Erling; DE KLERK, Etienne; TUNCEL, Levent et al.Mathematical programming. 2007, Vol 109, Num 2-3, issn 0025-5610, 418 p.Conference Proceedings

Dual extrapolation and its applications to solving variational inequalities and related problemsNESTEROV, Yurii.Mathematical programming. 2007, Vol 109, Num 2-3, pp 319-344, issn 0025-5610, 26 p.Conference Paper

Bounds for the quadratic assignment problem using the bundle methodRENDL, Franz; SOTIROV, Renata.Mathematical programming. 2007, Vol 109, Num 2-3, pp 505-524, issn 0025-5610, 20 p.Conference Paper

Large-scale semidefinite programs in electronic structure calculationFUKUDA, Mituhiro; BRAAMS, Bastiaan J; NAKATA, Maho et al.Mathematical programming. 2007, Vol 109, Num 2-3, pp 553-580, issn 0025-5610, 28 p.Conference Paper

IPCO 2005, Berlin, June 8-10, 2005JÜNGER, Michael; KAIBEL, Volker.Mathematical programming. 2007, Vol 110, Num 1, issn 0025-5610, 244 p.Conference Proceedings

Combinatorial algorithms for matchings, even factors and square-free 2-factorsPAP, Gyula.Mathematical programming. 2007, Vol 110, Num 1, pp 57-69, issn 0025-5610, 13 p.Conference Paper

Machine scheduling with resource dependent processing timesGRIGORIEV, Alexander; SVIRIDENKO, Maxim; UETZ, Marc et al.Mathematical programming. 2007, Vol 110, Num 1, pp 209-228, issn 0025-5610, 20 p.Conference Paper

Semidefinite programming relaxations for graph coloring and maximal clique problemsDUKANOVIC, Igor; RENDL, Franz.Mathematical programming. 2007, Vol 109, Num 2-3, pp 345-365, issn 0025-5610, 21 p.Conference Paper

  • Page / 96