Search dblp for Publications

export results for "toc:db/journals/mp/mp9.bht:"

 download as .bib file

@article{DBLP:journals/mp/BeerF75,
  author       = {C. N. Beer and
                  B. L. Foote},
  title        = {A procedure to rank bases by probability of being optimal using imbedded
                  hyperspheres},
  journal      = {Math. Program.},
  volume       = {9},
  number       = {1},
  pages        = {123--128},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01681335},
  doi          = {10.1007/BF01681335},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/BeerF75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Bertsekas75,
  author       = {Dimitri P. Bertsekas},
  title        = {Necessary and sufficient conditions for a penalty method to be exact},
  journal      = {Math. Program.},
  volume       = {9},
  number       = {1},
  pages        = {87--99},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01681332},
  doi          = {10.1007/BF01681332},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Bertsekas75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Best75,
  author       = {Michael J. Best},
  title        = {A method to accelerate the rate of convergence of a class of optimization
                  algorithms},
  journal      = {Math. Program.},
  volume       = {9},
  number       = {1},
  pages        = {139--160},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01681341},
  doi          = {10.1007/BF01681341},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Best75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/ByrdT75,
  author       = {Richard H. Byrd and
                  Richard A. Tapia},
  title        = {An extension of Curry's theorem to steepest descent in normed linear
                  spaces},
  journal      = {Math. Program.},
  volume       = {9},
  number       = {1},
  pages        = {247--254},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01681347},
  doi          = {10.1007/BF01681347},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/ByrdT75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Davidon75,
  author       = {William C. Davidon},
  title        = {Optimally conditioned optimization algorithms without line searches},
  journal      = {Math. Program.},
  volume       = {9},
  number       = {1},
  pages        = {1--30},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01681328},
  doi          = {10.1007/BF01681328},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Davidon75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Garcia75,
  author       = {C. B. Garc{\'{\i}}a},
  title        = {A fixed point theorem including the last theorem of Poincar{\'{e}}},
  journal      = {Math. Program.},
  volume       = {9},
  number       = {1},
  pages        = {227--239},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01681345},
  doi          = {10.1007/BF01681345},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Garcia75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Glover75,
  author       = {Fred W. Glover},
  title        = {Polyhedral annexation in mixed integer and combinatorial programming},
  journal      = {Math. Program.},
  volume       = {9},
  number       = {1},
  pages        = {161--188},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01681342},
  doi          = {10.1007/BF01681342},
  timestamp    = {Tue, 04 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Glover75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Graver75,
  author       = {Jack E. Graver},
  title        = {On the foundations of linear and integer linear programming {I}},
  journal      = {Math. Program.},
  volume       = {9},
  number       = {1},
  pages        = {207--226},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01681344},
  doi          = {10.1007/BF01681344},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Graver75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Hohenbalken75,
  author       = {Balder Von Hohenbalken},
  title        = {A finite algorithm to maximize certain pseudoconcave functions on
                  polytopes},
  journal      = {Math. Program.},
  volume       = {9},
  number       = {1},
  pages        = {189--206},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01681343},
  doi          = {10.1007/BF01681343},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Hohenbalken75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/JeroslowS75,
  author       = {Robert G. Jeroslow and
                  T. H. C. Smith},
  title        = {Experimental results on Hillier's linear search},
  journal      = {Math. Program.},
  volume       = {9},
  number       = {1},
  pages        = {371--376},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01681357},
  doi          = {10.1007/BF01681357},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/JeroslowS75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Kojima75,
  author       = {Masakazu Kojima},
  title        = {A unification of the existence theorems of the nonlinear complementarity
                  problem},
  journal      = {Math. Program.},
  volume       = {9},
  number       = {1},
  pages        = {257--277},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01681350},
  doi          = {10.1007/BF01681350},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Kojima75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Lawler75,
  author       = {Eugene L. Lawler},
  title        = {Matroid intersection algorithms},
  journal      = {Math. Program.},
  volume       = {9},
  number       = {1},
  pages        = {31--56},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01681329},
  doi          = {10.1007/BF01681329},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mp/Lawler75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Lenard75,
  author       = {Melanie L. Lenard},
  title        = {Practical convergence conditions for the Davidon-Fletcher-Powell method},
  journal      = {Math. Program.},
  volume       = {9},
  number       = {1},
  pages        = {69--86},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01681331},
  doi          = {10.1007/BF01681331},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Lenard75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Luthi75,
  author       = {Hans{-}Jakob L{\"{u}}thi},
  title        = {A simplicial approximation of a solution for the nonlinear complementarity
                  problem},
  journal      = {Math. Program.},
  volume       = {9},
  number       = {1},
  pages        = {278--293},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01681351},
  doi          = {10.1007/BF01681351},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Luthi75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/McKeown75,
  author       = {J. J. McKeown},
  title        = {Specialised versus general-purpose algorithms for minimising functions
                  that are sums of squared terms},
  journal      = {Math. Program.},
  volume       = {9},
  number       = {1},
  pages        = {57--68},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01681330},
  doi          = {10.1007/BF01681330},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/McKeown75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Mifflin75,
  author       = {Robert Mifflin},
  title        = {A superlinearly convergent algorithm for minimization without evaluating
                  derivatives},
  journal      = {Math. Program.},
  volume       = {9},
  number       = {1},
  pages        = {100--117},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01681333},
  doi          = {10.1007/BF01681333},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Mifflin75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/MukaiP75,
  author       = {H. Mukai and
                  Elijah Polak},
  title        = {A quadratically convergent primal-dual algorithm with global convergence
                  properties for solving optimization problems with equality constraints},
  journal      = {Math. Program.},
  volume       = {9},
  number       = {1},
  pages        = {336--349},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01681354},
  doi          = {10.1007/BF01681354},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/MukaiP75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Noltemeier75,
  author       = {Hartmut Noltemeier},
  title        = {An algorithm for the determination of longest distances in a graph},
  journal      = {Math. Program.},
  volume       = {9},
  number       = {1},
  pages        = {350--357},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01681355},
  doi          = {10.1007/BF01681355},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Noltemeier75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Owen75,
  author       = {Guillermo Owen},
  title        = {On the core of linear production games},
  journal      = {Math. Program.},
  volume       = {9},
  number       = {1},
  pages        = {358--370},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01681356},
  doi          = {10.1007/BF01681356},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Owen75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/PonsteinH75,
  author       = {Jacob Ponstein and
                  Willem K. Klein Haneveld},
  title        = {On a general saddle-point condition in normed spaces},
  journal      = {Math. Program.},
  volume       = {9},
  number       = {1},
  pages        = {118--122},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01681334},
  doi          = {10.1007/BF01681334},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/PonsteinH75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/SankoffR75,
  author       = {David Sankoff and
                  Pascale Rousseau},
  title        = {Locating the vertices of a steiner tree in an arbitrary metric space},
  journal      = {Math. Program.},
  volume       = {9},
  number       = {1},
  pages        = {240--246},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01681346},
  doi          = {10.1007/BF01681346},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/SankoffR75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Stoer75,
  author       = {Josef Stoer},
  title        = {On the convergence rate of imperfect minimization algorithms in Broyden's\emph{{\(\beta\)}}-class},
  journal      = {Math. Program.},
  volume       = {9},
  number       = {1},
  pages        = {313--335},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01681353},
  doi          = {10.1007/BF01681353},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Stoer75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Young75,
  author       = {R. D. Young},
  title        = {The eclectic primal algorithm: Cutting-plane method that accommodates
                  hybrid subproblem solution techniques},
  journal      = {Math. Program.},
  volume       = {9},
  number       = {1},
  pages        = {294--312},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01681352},
  doi          = {10.1007/BF01681352},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Young75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.