Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/mp/mp17.bht:"
@article{DBLP:journals/mp/Auslender79, author = {Alfred Auslender}, title = {Penalty methods for computing points that satisfy second order necessary conditions}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {229--238}, year = {1979}, url = {https://doi.org/10.1007/BF01588245}, doi = {10.1007/BF01588245}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Auslender79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Bastian79, author = {Michael Bastian}, title = {Updated triangular factors of the working basis in winkler's decomposition approach}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {391--397}, year = {1979}, url = {https://doi.org/10.1007/BF01588257}, doi = {10.1007/BF01588257}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Bastian79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Bell79, author = {David E. Bell}, title = {Efficient group cuts for integer programs}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {176--183}, year = {1979}, url = {https://doi.org/10.1007/BF01588242}, doi = {10.1007/BF01588242}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Bell79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Bitran79, author = {Gabriel R. Bitran}, title = {Theory and algorithms for linear multiple objective programs with zero-one variables}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {362--390}, year = {1979}, url = {https://doi.org/10.1007/BF01588256}, doi = {10.1007/BF01588256}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Bitran79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Charalambous79, author = {Christakis Charalambous}, title = {On conditions for optimality of the nonlinear \emph{l}\({}_{\mbox{1}}\) problem}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {123--135}, year = {1979}, url = {https://doi.org/10.1007/BF01588238}, doi = {10.1007/BF01588238}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Charalambous79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Charalambous79a, author = {Christakis Charalambous}, title = {Acceleration of the least \emph{p}th algorithm for minimax optimization with engineering applications}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {270--297}, year = {1979}, url = {https://doi.org/10.1007/BF01588251}, doi = {10.1007/BF01588251}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Charalambous79a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Dembo79, author = {Ron S. Dembo}, title = {Second order algorithms for the posynomial geometric programming dual, part {I:} Analysis}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {156--175}, year = {1979}, url = {https://doi.org/10.1007/BF01588241}, doi = {10.1007/BF01588241}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Dembo79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/DinkelK79, author = {John J. Dinkel and Gary A. Kochenberger}, title = {Some remarks on condensation methods for geometric programs}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {109--113}, year = {1979}, url = {https://doi.org/10.1007/BF01588231}, doi = {10.1007/BF01588231}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/DinkelK79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Fathi79, author = {Yahya Fathi}, title = {Computational complexity of LCPs associated with positive definite symmetric matrices}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {335--344}, year = {1979}, url = {https://doi.org/10.1007/BF01588254}, doi = {10.1007/BF01588254}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Fathi79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/GarciaG79, author = {C. B. Garc{\'{\i}}a and Floyd J. Gould}, title = {Scalar labelings for homotopy paths}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {184--197}, year = {1979}, url = {https://doi.org/10.1007/BF01588243}, doi = {10.1007/BF01588243}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/GarciaG79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/GillM79, author = {Philip E. Gill and Walter Murray}, title = {The computation of Lagrange-multiplier estimates for constrained minimization}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {32--60}, year = {1979}, url = {https://doi.org/10.1007/BF01588224}, doi = {10.1007/BF01588224}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/GillM79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/GladP79, author = {S. Torkel Glad and Elijah Polak}, title = {A multiplier method with automatic limitation of penalty growth}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {140--155}, year = {1979}, url = {https://doi.org/10.1007/BF01588240}, doi = {10.1007/BF01588240}, timestamp = {Mon, 02 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/GladP79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/GloverK79, author = {Fred W. Glover and Darwin Klingman}, title = {A o(\emph{n} log\emph{n}) algorithm for {LP} knapsacks with {GUB} constraints}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {345--361}, year = {1979}, url = {https://doi.org/10.1007/BF01588255}, doi = {10.1007/BF01588255}, timestamp = {Tue, 04 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/GloverK79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/GuignardS79, author = {Monique Guignard and Kurt Spielberg}, title = {A direct dual method for the mixed plant location problem with some side constraints}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {198--228}, year = {1979}, url = {https://doi.org/10.1007/BF01588244}, doi = {10.1007/BF01588244}, timestamp = {Fri, 16 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/GuignardS79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/HanM79, author = {Shih{-}Ping Han and Olvi L. Mangasarian}, title = {Exact penalty functions in nonlinear programming}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {251--269}, year = {1979}, url = {https://doi.org/10.1007/BF01588250}, doi = {10.1007/BF01588250}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/HanM79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Jeroslow79, author = {Robert G. Jeroslow}, title = {Minimal inequalities}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {1--15}, year = {1979}, url = {https://doi.org/10.1007/BF01588222}, doi = {10.1007/BF01588222}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Jeroslow79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Kaneko79, author = {Ikuyo Kaneko}, title = {The number of solutions of a class of linear complementarity problems}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {104--105}, year = {1979}, url = {https://doi.org/10.1007/BF01588229}, doi = {10.1007/BF01588229}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Kaneko79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/KarwanR79, author = {Mark H. Karwan and Ronald L. Rardin}, title = {Some relationships between lagrangian and surrogate duality in integer programming}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {320--334}, year = {1979}, url = {https://doi.org/10.1007/BF01588253}, doi = {10.1007/BF01588253}, timestamp = {Thu, 08 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/KarwanR79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/KojimaS79, author = {Masakazu Kojima and Romesh Saigal}, title = {On the number of solutions to a class of linear complementarity problems}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {136--139}, year = {1979}, url = {https://doi.org/10.1007/BF01588239}, doi = {10.1007/BF01588239}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/KojimaS79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/LaanT79, author = {Gerard van der Laan and A. J. J. Talman}, title = {A restart algorithm for computing fixed points without an extra dimension}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {74--84}, year = {1979}, url = {https://doi.org/10.1007/BF01588226}, doi = {10.1007/BF01588226}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/LaanT79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Lehman79, author = {Alfred Lehman}, title = {On the width - length inequality}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {403--417}, year = {1979}, url = {https://doi.org/10.1007/BF01588263}, doi = {10.1007/BF01588263}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Lehman79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Madsen79, author = {Oli B. G. Madsen}, title = {Glass cutting in a small firm}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {85--90}, year = {1979}, url = {https://doi.org/10.1007/BF01588227}, doi = {10.1007/BF01588227}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Madsen79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/MonmaT79, author = {Clyde L. Monma and Leslie E. Trotter Jr.}, title = {On perfect graphs and polyhedra with (0, 1)-valued extreme points}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {239--242}, year = {1979}, url = {https://doi.org/10.1007/BF01588246}, doi = {10.1007/BF01588246}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/MonmaT79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Mukai79, author = {H. Mukai}, title = {Readily implementable conjugate gradient methods}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {298--319}, year = {1979}, url = {https://doi.org/10.1007/BF01588252}, doi = {10.1007/BF01588252}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Mukai79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Pang79, author = {Jong{-}Shi Pang}, title = {On \emph{Q}-matrices}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {243--247}, year = {1979}, url = {https://doi.org/10.1007/BF01588247}, doi = {10.1007/BF01588247}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Pang79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/PolakTM79, author = {Elijah Polak and Russell E. Trahan and David Q. Mayne}, title = {Combined phase {I} - phase {II} methods of feasible directions}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {61--73}, year = {1979}, url = {https://doi.org/10.1007/BF01588225}, doi = {10.1007/BF01588225}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/PolakTM79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Pulleyblank79, author = {William R. Pulleyblank}, title = {Minimum node covers and 2-bicritical graphs}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {91--103}, year = {1979}, url = {https://doi.org/10.1007/BF01588228}, doi = {10.1007/BF01588228}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Pulleyblank79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Steuer79, author = {Ralph E. Steuer}, title = {Goal programming sensitivity analysis using interval penalty weights}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {16--31}, year = {1979}, url = {https://doi.org/10.1007/BF01588223}, doi = {10.1007/BF01588223}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Steuer79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Todd79, author = {Michael J. Todd}, title = {Piecewise linear paths to minimize convex functions may not be monotonic}, journal = {Math. Program.}, volume = {17}, number = {1}, pages = {106--108}, year = {1979}, url = {https://doi.org/10.1007/BF01588230}, doi = {10.1007/BF01588230}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Todd79.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.