Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/mp/Bard88,
  author       = {Jonathan F. Bard},
  title        = {Convex two-level optimization},
  journal      = {Math. Program.},
  volume       = {40},
  number       = {1-3},
  pages        = {15--27},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01580720},
  doi          = {10.1007/BF01580720},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Bard88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/ByrdSS88a,
  author       = {Richard H. Byrd and
                  Robert B. Schnabel and
                  Gerald A. Shultz},
  title        = {Approximate solution of the trust region problem by minimization over
                  two-dimensional subspaces},
  journal      = {Math. Program.},
  volume       = {40},
  number       = {1-3},
  pages        = {247--263},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01580735},
  doi          = {10.1007/BF01580735},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/ByrdSS88a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Chaney88,
  author       = {Robin W. Chaney},
  title        = {Second-order necessary conditions in semismooth optimization},
  journal      = {Math. Program.},
  volume       = {40},
  number       = {1-3},
  pages        = {95--109},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01580725},
  doi          = {10.1007/BF01580725},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Chaney88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Coleman88,
  author       = {Thomas F. Coleman},
  title        = {A chordal preconditioner for large-scale optimization},
  journal      = {Math. Program.},
  volume       = {40},
  number       = {1-3},
  pages        = {265--287},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01580736},
  doi          = {10.1007/BF01580736},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Coleman88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/FiaccoK88,
  author       = {Anthony V. Fiacco and
                  Jerzy Kyparisis},
  title        = {Computable bounds on parametric solutions of convex problems},
  journal      = {Math. Program.},
  volume       = {40},
  number       = {1-3},
  pages        = {213--221},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01580732},
  doi          = {10.1007/BF01580732},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/FiaccoK88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Fleischmann88,
  author       = {Bernhard Fleischmann},
  title        = {A new class of cutting planes for the symmetric travelling salesman
                  problem},
  journal      = {Math. Program.},
  volume       = {40},
  number       = {1-3},
  pages        = {225--246},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01580734},
  doi          = {10.1007/BF01580734},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Fleischmann88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Gay88,
  author       = {David M. Gay},
  title        = {A variant of Karmarkar's linear programming algorithm for problems
                  in standard form},
  journal      = {Math. Program.},
  volume       = {40},
  number       = {1-3},
  pages        = {111},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01580726},
  doi          = {10.1007/BF01580726},
  timestamp    = {Tue, 26 Jun 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Gay88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/GloverK88,
  author       = {Fred W. Glover and
                  Darwin Klingman},
  title        = {Layering strategies for creating exploitable structure in linear and
                  integer programs},
  journal      = {Math. Program.},
  volume       = {40},
  number       = {1-3},
  pages        = {165--181},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01580728},
  doi          = {10.1007/BF01580728},
  timestamp    = {Tue, 04 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/GloverK88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/GoldfarbM88,
  author       = {Donald Goldfarb and
                  Sanjay Mehrotra},
  title        = {Relaxed variants of Karmarkar's algorithm for linear programs with
                  unknown optimal objective value},
  journal      = {Math. Program.},
  volume       = {40},
  number       = {1-3},
  pages        = {183--195},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01580729},
  doi          = {10.1007/BF01580729},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/GoldfarbM88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/GoldfarbM88a,
  author       = {Donald Goldfarb and
                  Sanjay Mehrotra},
  title        = {A relaxed version of Karmarkar's method},
  journal      = {Math. Program.},
  volume       = {40},
  number       = {1-3},
  pages        = {289--315},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01580737},
  doi          = {10.1007/BF01580737},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/GoldfarbM88a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Han88,
  author       = {Shih{-}Ping Han},
  title        = {A successive projection method},
  journal      = {Math. Program.},
  volume       = {40},
  number       = {1-3},
  pages        = {1--14},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01580719},
  doi          = {10.1007/BF01580719},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Han88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Hoffman88,
  author       = {Alan J. Hoffman},
  title        = {On greedy algorithms for series parallel graphs},
  journal      = {Math. Program.},
  volume       = {40},
  number       = {1-3},
  pages        = {197--204},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01580730},
  doi          = {10.1007/BF01580730},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Hoffman88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Imai88,
  author       = {Hiroshi Imai},
  title        = {On the convexity of the multiplicative version of Karmarkar's potential
                  function},
  journal      = {Math. Program.},
  volume       = {40},
  number       = {1-3},
  pages        = {29--32},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01580721},
  doi          = {10.1007/BF01580721},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Imai88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Mahjoub88,
  author       = {Ali Ridha Mahjoub},
  title        = {On the stable set polytope of a series-parallel graph},
  journal      = {Math. Program.},
  volume       = {40},
  number       = {1-3},
  pages        = {53--57},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01580723},
  doi          = {10.1007/BF01580723},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Mahjoub88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Meyer88,
  author       = {Gerard G. L. Meyer},
  title        = {Convergence of relaxation algorithms by averaging},
  journal      = {Math. Program.},
  volume       = {40},
  number       = {1-3},
  pages        = {205--212},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01580731},
  doi          = {10.1007/BF01580731},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Meyer88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Mifflin88,
  author       = {Robert Mifflin},
  title        = {An implementation of an algorithm for univariate minimization and
                  an application to nested optimization},
  journal      = {Math. Program.},
  volume       = {40},
  number       = {1-3},
  pages        = {223},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01580733},
  doi          = {10.1007/BF01580733},
  timestamp    = {Tue, 26 Jun 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Mifflin88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/PochetW88,
  author       = {Yves Pochet and
                  Laurence A. Wolsey},
  title        = {Lot-size models with backlogging: Strong reformulations and cutting
                  planes},
  journal      = {Math. Program.},
  volume       = {40},
  number       = {1-3},
  pages        = {317--335},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01580738},
  doi          = {10.1007/BF01580738},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/PochetW88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Renegar88,
  author       = {James Renegar},
  title        = {A polynomial-time algorithm, based on Newton's method, for linear
                  programming},
  journal      = {Math. Program.},
  volume       = {40},
  number       = {1-3},
  pages        = {59--93},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01580724},
  doi          = {10.1007/BF01580724},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Renegar88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Renegar88a,
  author       = {James Renegar},
  title        = {Rudiments of an average case complexity theory for piecewise-linear
                  path following algorithms},
  journal      = {Math. Program.},
  volume       = {40},
  number       = {1-3},
  pages        = {113--163},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01580727},
  doi          = {10.1007/BF01580727},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Renegar88a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Tobin88,
  author       = {Roger L. Tobin},
  title        = {A variable dimension solution approach for the general spatial price
                  equilibrium problem},
  journal      = {Math. Program.},
  volume       = {40},
  number       = {1-3},
  pages        = {33--51},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01580722},
  doi          = {10.1007/BF01580722},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Tobin88.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.