Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/mp/AwoniyiT83,
  author       = {Samuel A. Awoniyi and
                  Michael J. Todd},
  title        = {An efficient simplicial algorithm for computing a zero of a convex
                  union of smooth functions},
  journal      = {Math. Program.},
  volume       = {25},
  number       = {1},
  pages        = {83--108},
  year         = {1983},
  url          = {https://doi.org/10.1007/BF02591720},
  doi          = {10.1007/BF02591720},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/AwoniyiT83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/BestC83,
  author       = {Michael J. Best and
                  Richard J. Caron},
  title        = {A method to increase the computational efficiency of certain quadratic
                  programming algorithms},
  journal      = {Math. Program.},
  volume       = {25},
  number       = {3},
  pages        = {354--358},
  year         = {1983},
  url          = {https://doi.org/10.1007/BF02594785},
  doi          = {10.1007/BF02594785},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/BestC83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Brown83,
  author       = {J. Randall Brown},
  title        = {The flow circulation sharing problem},
  journal      = {Math. Program.},
  volume       = {25},
  number       = {2},
  pages        = {199--227},
  year         = {1983},
  url          = {https://doi.org/10.1007/BF02591771},
  doi          = {10.1007/BF02591771},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Brown83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/FedergruenZ83,
  author       = {Awi Federgruen and
                  Paul H. Zipkin},
  title        = {Solution techniques for some allocation problems},
  journal      = {Math. Program.},
  volume       = {25},
  number       = {1},
  pages        = {13--24},
  year         = {1983},
  url          = {https://doi.org/10.1007/BF02591716},
  doi          = {10.1007/BF02591716},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/FedergruenZ83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Fourer83,
  author       = {Robert Fourer},
  title        = {Solving staircase linear programs by the simplex method, 2: Pricing},
  journal      = {Math. Program.},
  volume       = {25},
  number       = {3},
  pages        = {251--292},
  year         = {1983},
  url          = {https://doi.org/10.1007/BF02594780},
  doi          = {10.1007/BF02594780},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Fourer83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Grinold83,
  author       = {Richard Grinold},
  title        = {Convex infinite horizon programs},
  journal      = {Math. Program.},
  volume       = {25},
  number       = {1},
  pages        = {64--82},
  year         = {1983},
  url          = {https://doi.org/10.1007/BF02591719},
  doi          = {10.1007/BF02591719},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Grinold83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/HanM83,
  author       = {Shih{-}Ping Han and
                  Olvi L. Mangasarian},
  title        = {A dual differentiable exact penalty function},
  journal      = {Math. Program.},
  volume       = {25},
  number       = {3},
  pages        = {293--306},
  year         = {1983},
  url          = {https://doi.org/10.1007/BF02594781},
  doi          = {10.1007/BF02594781},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/HanM83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Hassin83,
  author       = {Refael Hassin},
  title        = {The minimum cost flow problem: {A} unifying approach to dual algorithms
                  and a new tree-search algorithm},
  journal      = {Math. Program.},
  volume       = {25},
  number       = {2},
  pages        = {228--239},
  year         = {1983},
  url          = {https://doi.org/10.1007/BF02591772},
  doi          = {10.1007/BF02591772},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Hassin83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Jahn83,
  author       = {Johannes Jahn},
  title        = {Duality in vector optimization},
  journal      = {Math. Program.},
  volume       = {25},
  number       = {3},
  pages        = {343--353},
  year         = {1983},
  url          = {https://doi.org/10.1007/BF02594784},
  doi          = {10.1007/BF02594784},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Jahn83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Jones83,
  author       = {Philip C. Jones},
  title        = {A note on the Talman, Van der Heyden linear complementarity algorithm},
  journal      = {Math. Program.},
  volume       = {25},
  number       = {1},
  pages        = {122--124},
  year         = {1983},
  url          = {https://doi.org/10.1007/BF02591722},
  doi          = {10.1007/BF02591722},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Jones83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Kalliauer83,
  author       = {A. Kalliauer},
  title        = {An algorithm for hierarchical optimization of large-scale problems
                  with nested structure},
  journal      = {Math. Program.},
  volume       = {25},
  number       = {1},
  pages        = {25--45},
  year         = {1983},
  url          = {https://doi.org/10.1007/BF02591717},
  doi          = {10.1007/BF02591717},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Kalliauer83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Kohlberg83,
  author       = {Elon Kohlberg},
  title        = {Consistency of finite systems of convex inequalities},
  journal      = {Math. Program.},
  volume       = {25},
  number       = {3},
  pages        = {359--362},
  year         = {1983},
  url          = {https://doi.org/10.1007/BF02594786},
  doi          = {10.1007/BF02594786},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Kohlberg83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/KojimaM83,
  author       = {Masakazu Kojima and
                  Shinji Mizuno},
  title        = {Computation of all solutions to a system of polynomial equations},
  journal      = {Math. Program.},
  volume       = {25},
  number       = {2},
  pages        = {131--157},
  year         = {1983},
  url          = {https://doi.org/10.1007/BF02591768},
  doi          = {10.1007/BF02591768},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/KojimaM83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/LaanT83,
  author       = {Gerard van der Laan and
                  A. J. J. Talman},
  title        = {Note on the path following approach of equilibrium programming},
  journal      = {Math. Program.},
  volume       = {25},
  number       = {3},
  pages        = {363--367},
  year         = {1983},
  url          = {https://doi.org/10.1007/BF02594787},
  doi          = {10.1007/BF02594787},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/LaanT83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/McDiarmid83,
  author       = {Colin McDiarmid},
  title        = {Integral decomposition in polyhedra},
  journal      = {Math. Program.},
  volume       = {25},
  number       = {2},
  pages        = {183--198},
  year         = {1983},
  url          = {https://doi.org/10.1007/BF02591770},
  doi          = {10.1007/BF02591770},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/McDiarmid83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/MurtaghS83,
  author       = {Bruce A. Murtagh and
                  Fawzy Soliman},
  title        = {Subgradient optimization applied to a discrete nonlinear problem in
                  engineering design},
  journal      = {Math. Program.},
  volume       = {25},
  number       = {1},
  pages        = {1--12},
  year         = {1983},
  url          = {https://doi.org/10.1007/BF02591715},
  doi          = {10.1007/BF02591715},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/MurtaghS83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Ponstein83,
  author       = {Jacob Ponstein},
  title        = {Comments on the general duality survey by J. Tind and {L.A.} Wolsey},
  journal      = {Math. Program.},
  volume       = {25},
  number       = {2},
  pages        = {240--244},
  year         = {1983},
  url          = {https://doi.org/10.1007/BF02591773},
  doi          = {10.1007/BF02591773},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Ponstein83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Roy83,
  author       = {Tony J. Van Roy},
  title        = {Cross decomposition for mixed integer programming},
  journal      = {Math. Program.},
  volume       = {25},
  number       = {1},
  pages        = {46--63},
  year         = {1983},
  url          = {https://doi.org/10.1007/BF02591718},
  doi          = {10.1007/BF02591718},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Roy83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/SchnabelT83,
  author       = {Robert B. Schnabel and
                  Philippe L. Toint},
  title        = {Forcing sparsity by projecting with respect to a non-diagonally weighted
                  frobenius norm},
  journal      = {Math. Program.},
  volume       = {25},
  number       = {1},
  pages        = {125--129},
  year         = {1983},
  url          = {https://doi.org/10.1007/BF02591723},
  doi          = {10.1007/BF02591723},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mp/SchnabelT83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/StrodiotNH83,
  author       = {Jean{-}Jacques Strodiot and
                  Van Hien Nguyen and
                  Norbert Heukemes},
  title        = {{\(\epsilon\)}-Optimal solutions in nondifferentiable convex programming
                  and some related questions},
  journal      = {Math. Program.},
  volume       = {25},
  number       = {3},
  pages        = {307--328},
  year         = {1983},
  url          = {https://doi.org/10.1007/BF02594782},
  doi          = {10.1007/BF02594782},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/StrodiotNH83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Thapa83,
  author       = {Mukund N. Thapa},
  title        = {Optimization of unconstrained functions with sparse Hessian matrices
                  - Quasi-Newton methods},
  journal      = {Math. Program.},
  volume       = {25},
  number       = {2},
  pages        = {158--182},
  year         = {1983},
  url          = {https://doi.org/10.1007/BF02591769},
  doi          = {10.1007/BF02591769},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Thapa83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Yamamoto83,
  author       = {Yoshitsugu Yamamoto},
  title        = {A new variable dimension algorithm for the fixed point problem},
  journal      = {Math. Program.},
  volume       = {25},
  number       = {3},
  pages        = {329--342},
  year         = {1983},
  url          = {https://doi.org/10.1007/BF02594783},
  doi          = {10.1007/BF02594783},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Yamamoto83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Zlobec83,
  author       = {Sanjo Zlobec},
  title        = {Characterizing an optimal input in perturbed convex programming},
  journal      = {Math. Program.},
  volume       = {25},
  number       = {1},
  pages        = {109--121},
  year         = {1983},
  url          = {https://doi.org/10.1007/BF02591721},
  doi          = {10.1007/BF02591721},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Zlobec83.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.