default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/mp/mp32.bht:"
download as .bib file
@article{DBLP:journals/mp/ArrowDM85,
author = {Kenneth J. Arrow and
George B. Dantzig and
Alan Manne},
title = {In memory of Tjalling C. Koopmans},
journal = {Math. Program.},
volume = {32},
number = {2},
pages = {123},
year = {1985},
url = {https://doi.org/10.1007/BF01586086},
doi = {10.1007/BF01586086},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/ArrowDM85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Bertsekas85,
author = {Dimitri P. Bertsekas},
title = {A unified framework for primal-dual methods in minimum cost network
flow problems},
journal = {Math. Program.},
volume = {32},
number = {2},
pages = {125--145},
year = {1985},
url = {https://doi.org/10.1007/BF01586087},
doi = {10.1007/BF01586087},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Bertsekas85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BrownMW85,
author = {Gerald G. Brown and
Richard D. McBride and
R. Kevin Wood},
title = {Extracting embedded generalized networks from linear programming problems},
journal = {Math. Program.},
volume = {32},
number = {1},
pages = {11--31},
year = {1985},
url = {https://doi.org/10.1007/BF01585656},
doi = {10.1007/BF01585656},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/BrownMW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Byrd85,
author = {Richard H. Byrd},
title = {An example of irregular convergence in some constrained optimization
methods that use the projected hessian},
journal = {Math. Program.},
volume = {32},
number = {2},
pages = {232--237},
year = {1985},
url = {https://doi.org/10.1007/BF01586093},
doi = {10.1007/BF01586093},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Byrd85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/CavalierS85,
author = {Tom M. Cavalier and
Hanif D. Sherali},
title = {Sequential location-allocation problems on chains and trees with probabilistic
link demands},
journal = {Math. Program.},
volume = {32},
number = {3},
pages = {249--277},
year = {1985},
url = {https://doi.org/10.1007/BF01582049},
doi = {10.1007/BF01582049},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/CavalierS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/CoopeW85,
author = {Ian D. Coope and
G. Alistair Watson},
title = {A projected lagrangian algorithm for semi-infinite programming},
journal = {Math. Program.},
volume = {32},
number = {3},
pages = {337--356},
year = {1985},
url = {https://doi.org/10.1007/BF01582053},
doi = {10.1007/BF01582053},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/CoopeW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Engelbrecht-Wiggans85,
author = {Richard Engelbrecht{-}Wiggans and
Daniel Granot},
title = {On market prices in linear production games},
journal = {Math. Program.},
volume = {32},
number = {3},
pages = {366--370},
year = {1985},
url = {https://doi.org/10.1007/BF01582055},
doi = {10.1007/BF01582055},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Engelbrecht-Wiggans85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Gould85,
author = {Nicholas I. M. Gould},
title = {On practical conditions for the existence and uniqueness of solutions
to the general equality quadratic programming problem},
journal = {Math. Program.},
volume = {32},
number = {1},
pages = {90--99},
year = {1985},
url = {https://doi.org/10.1007/BF01585660},
doi = {10.1007/BF01585660},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Gould85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/JerominK85,
author = {Bernd Jeromin and
Frank K{\"{o}}rner},
title = {On the refinement of bounds of heuristic algorithms for the traveling
salesman problem},
journal = {Math. Program.},
volume = {32},
number = {1},
pages = {114--117},
year = {1985},
url = {https://doi.org/10.1007/BF01585662},
doi = {10.1007/BF01585662},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/JerominK85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Jeroslow85,
author = {Robert G. Jeroslow},
title = {The polynomial hierarchy and a simple model for competitive analysis},
journal = {Math. Program.},
volume = {32},
number = {2},
pages = {146--164},
year = {1985},
url = {https://doi.org/10.1007/BF01586088},
doi = {10.1007/BF01586088},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Jeroslow85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Karzanov85,
author = {Alexander V. Karzanov},
title = {Metrics and undirected cuts},
journal = {Math. Program.},
volume = {32},
number = {2},
pages = {183--198},
year = {1985},
url = {https://doi.org/10.1007/BF01586090},
doi = {10.1007/BF01586090},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Karzanov85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Kyparisis85,
author = {Jerzy Kyparisis},
title = {On uniqueness of Kuhn-Tucker multipliers in nonlinear programming},
journal = {Math. Program.},
volume = {32},
number = {2},
pages = {242--246},
year = {1985},
url = {https://doi.org/10.1007/BF01586095},
doi = {10.1007/BF01586095},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Kyparisis85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Lazimy85,
author = {Rafael Lazimy},
title = {Improved algorithm for mixed-integer quadratic programs and a computational
study},
journal = {Math. Program.},
volume = {32},
number = {1},
pages = {100--113},
year = {1985},
url = {https://doi.org/10.1007/BF01585661},
doi = {10.1007/BF01585661},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Lazimy85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Le85,
author = {D. Le},
title = {A fast and robust unconstrained optimization method requiring minimum
storage},
journal = {Math. Program.},
volume = {32},
number = {1},
pages = {41--68},
year = {1985},
url = {https://doi.org/10.1007/BF01585658},
doi = {10.1007/BF01585658},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Le85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/MangasarianM85,
author = {Olvi L. Mangasarian and
L. McLinden},
title = {Simple bounds for solutions of monotone complementarity problems and
convex programs},
journal = {Math. Program.},
volume = {32},
number = {1},
pages = {32--40},
year = {1985},
url = {https://doi.org/10.1007/BF01585657},
doi = {10.1007/BF01585657},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/MangasarianM85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/MortonRR85,
author = {George Morton and
Rabe von Randow and
Karl Ringwald},
title = {A greedy algorithm for solving a class of convex programming problems
and its connection with polymatroid theory},
journal = {Math. Program.},
volume = {32},
number = {2},
pages = {238--241},
year = {1985},
url = {https://doi.org/10.1007/BF01586094},
doi = {10.1007/BF01586094},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/MortonRR85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/OrlinR85,
author = {James B. Orlin and
Uriel G. Rothblum},
title = {Computing optimal scalings by parametric network algorithms},
journal = {Math. Program.},
volume = {32},
number = {1},
pages = {1--10},
year = {1985},
url = {https://doi.org/10.1007/BF01585655},
doi = {10.1007/BF01585655},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/OrlinR85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/PassyP85,
author = {Ury Passy and
Eliezer Z. Prisman},
title = {A convex-like duality scheme for quasi-convex programs},
journal = {Math. Program.},
volume = {32},
number = {3},
pages = {278--300},
year = {1985},
url = {https://doi.org/10.1007/BF01582050},
doi = {10.1007/BF01582050},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/PassyP85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Renegar85,
author = {James Renegar},
title = {On the complexity of a piecewise linear algorithm for approximating
roots of complex polynomials},
journal = {Math. Program.},
volume = {32},
number = {3},
pages = {301--318},
year = {1985},
url = {https://doi.org/10.1007/BF01582051},
doi = {10.1007/BF01582051},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Renegar85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Renegar85a,
author = {James Renegar},
title = {On the cost of approximating all roots of a complex polynomial},
journal = {Math. Program.},
volume = {32},
number = {3},
pages = {319--336},
year = {1985},
url = {https://doi.org/10.1007/BF01582052},
doi = {10.1007/BF01582052},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Renegar85a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Rothblum85,
author = {Uriel G. Rothblum},
title = {Ratios of affine functions},
journal = {Math. Program.},
volume = {32},
number = {3},
pages = {357--365},
year = {1985},
url = {https://doi.org/10.1007/BF01582054},
doi = {10.1007/BF01582054},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Rothblum85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Spingarn85,
author = {Jonathan E. Spingarn},
title = {Applications of the method of partial inverses to convex programming:
Decomposition},
journal = {Math. Program.},
volume = {32},
number = {2},
pages = {199--223},
year = {1985},
url = {https://doi.org/10.1007/BF01586091},
doi = {10.1007/BF01586091},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Spingarn85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Suhl85,
author = {Uwe H. Suhl},
title = {Solving large-scale mixed-integer programs with fixed charge variables},
journal = {Math. Program.},
volume = {32},
number = {2},
pages = {165--182},
year = {1985},
url = {https://doi.org/10.1007/BF01586089},
doi = {10.1007/BF01586089},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Suhl85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Womersley85,
author = {Robert S. Womersley},
title = {Local properties of algorithms for minimizing nonsmooth composite
functions},
journal = {Math. Program.},
volume = {32},
number = {1},
pages = {69--89},
year = {1985},
url = {https://doi.org/10.1007/BF01585659},
doi = {10.1007/BF01585659},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Womersley85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Yuan85,
author = {Ya{-}Xiang Yuan},
title = {An only 2-step Q-superlinear convergence example for some algorithms
that use reduced hessian approximations},
journal = {Math. Program.},
volume = {32},
number = {2},
pages = {224--231},
year = {1985},
url = {https://doi.org/10.1007/BF01586092},
doi = {10.1007/BF01586092},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Yuan85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
retrieved on 2025-03-13 02:42 CET from data curated 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:
