Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/mp/BaumT82,
  author       = {Stephen Baum and
                  Leslie E. Trotter Jr.},
  title        = {Finite checkability for integer rounding properties in combinatorial
                  programming problems},
  journal      = {Math. Program.},
  volume       = {22},
  number       = {1},
  pages        = {141--147},
  year         = {1982},
  url          = {https://doi.org/10.1007/BF01581034},
  doi          = {10.1007/BF01581034},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/BaumT82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Benveniste82,
  author       = {Regina Benveniste},
  title        = {Evaluating computational efficiency: {A} stochastic approach},
  journal      = {Math. Program.},
  volume       = {22},
  number       = {1},
  pages        = {261--287},
  year         = {1982},
  url          = {https://doi.org/10.1007/BF01581043},
  doi          = {10.1007/BF01581043},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Benveniste82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BoenderKTS82,
  author       = {C. G. E. Boender and
                  A. H. G. Rinnooy Kan and
                  G. T. Timmer and
                  Leen Stougie},
  title        = {A stochastic method for global optimization},
  journal      = {Math. Program.},
  volume       = {22},
  number       = {1},
  pages        = {125--140},
  year         = {1982},
  url          = {https://doi.org/10.1007/BF01581033},
  doi          = {10.1007/BF01581033},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/BoenderKTS82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/ChandrasekaranT82,
  author       = {R. Chandrasekaran and
                  Arie Tamir},
  title        = {Polynomially bounded algorithms for locating \emph{p}-centers on a
                  tree},
  journal      = {Math. Program.},
  volume       = {22},
  number       = {1},
  pages        = {304--315},
  year         = {1982},
  url          = {https://doi.org/10.1007/BF01581045},
  doi          = {10.1007/BF01581045},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/ChandrasekaranT82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Chaney82,
  author       = {Robin W. Chaney},
  title        = {A method of centers algorithm for certain minimax problems},
  journal      = {Math. Program.},
  volume       = {22},
  number       = {1},
  pages        = {202--226},
  year         = {1982},
  url          = {https://doi.org/10.1007/BF01581037},
  doi          = {10.1007/BF01581037},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Chaney82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Dax82,
  author       = {Achiya Dax},
  title        = {Partial pivoting strategies for symmetric gaussian elimination},
  journal      = {Math. Program.},
  volume       = {22},
  number       = {1},
  pages        = {288--303},
  year         = {1982},
  url          = {https://doi.org/10.1007/BF01581044},
  doi          = {10.1007/BF01581044},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Dax82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Drezner82,
  author       = {Zvi Drezner},
  title        = {On minimax optimization problems},
  journal      = {Math. Program.},
  volume       = {22},
  number       = {1},
  pages        = {227--230},
  year         = {1982},
  url          = {https://doi.org/10.1007/BF01581038},
  doi          = {10.1007/BF01581038},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Drezner82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/FattlerRSRR82,
  author       = {J. E. Fattler and
                  Gintaras V. Reklaitis and
                  Y. T. Sin and
                  R. R. Root and
                  K. M. Ragsdell},
  title        = {On the computational utility of posynomial geometric programming solution
                  methods},
  journal      = {Math. Program.},
  volume       = {22},
  number       = {1},
  pages        = {163--201},
  year         = {1982},
  url          = {https://doi.org/10.1007/BF01581036},
  doi          = {10.1007/BF01581036},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/FattlerRSRR82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Giles82,
  author       = {Rick Giles},
  title        = {Optimum matching forests {I:} Special weights},
  journal      = {Math. Program.},
  volume       = {22},
  number       = {1},
  pages        = {1--11},
  year         = {1982},
  url          = {https://doi.org/10.1007/BF01581022},
  doi          = {10.1007/BF01581022},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Giles82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Giles82a,
  author       = {Rick Giles},
  title        = {Optimum matching forests {II:} General weights},
  journal      = {Math. Program.},
  volume       = {22},
  number       = {1},
  pages        = {12--38},
  year         = {1982},
  url          = {https://doi.org/10.1007/BF01581023},
  doi          = {10.1007/BF01581023},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Giles82a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Giles82b,
  author       = {Rick Giles},
  title        = {Optimum matching forests {III:} Facets of matching forest polyhedra},
  journal      = {Math. Program.},
  volume       = {22},
  number       = {1},
  pages        = {39--51},
  year         = {1982},
  url          = {https://doi.org/10.1007/BF01581024},
  doi          = {10.1007/BF01581024},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Giles82b.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Goffin82,
  author       = {Jean{-}Louis Goffin},
  title        = {On the non-polynomiality of the relaxation method for systems of linear
                  inequalities},
  journal      = {Math. Program.},
  volume       = {22},
  number       = {1},
  pages        = {93--103},
  year         = {1982},
  url          = {https://doi.org/10.1007/BF01581028},
  doi          = {10.1007/BF01581028},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Goffin82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Goffin82a,
  author       = {Jean{-}Louis Goffin},
  title        = {Convergence of a cyclic ellipsoid algorithm for systems of linear
                  equalities},
  journal      = {Math. Program.},
  volume       = {22},
  number       = {1},
  pages        = {239--260},
  year         = {1982},
  url          = {https://doi.org/10.1007/BF01581042},
  doi          = {10.1007/BF01581042},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Goffin82a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/GranotGV82,
  author       = {Daniel Granot and
                  Frieda Granot and
                  Willem Vaessen},
  title        = {An accelerated covering relaxation algorithm for solving 0-1 positive
                  polynomial programs},
  journal      = {Math. Program.},
  volume       = {22},
  number       = {1},
  pages        = {350--357},
  year         = {1982},
  url          = {https://doi.org/10.1007/BF01581048},
  doi          = {10.1007/BF01581048},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/GranotGV82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Hochbaum82,
  author       = {Dorit S. Hochbaum},
  title        = {Heuristics for the fixed cost median problem},
  journal      = {Math. Program.},
  volume       = {22},
  number       = {1},
  pages        = {148--162},
  year         = {1982},
  url          = {https://doi.org/10.1007/BF01581035},
  doi          = {10.1007/BF01581035},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mp/Hochbaum82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/JarvisT82,
  author       = {John J. Jarvis and
                  S{\"{u}}leyman T{\"{u}}fekci},
  title        = {Decomposition algorithms for locating minimal cuts in a network},
  journal      = {Math. Program.},
  volume       = {22},
  number       = {1},
  pages        = {316--331},
  year         = {1982},
  url          = {https://doi.org/10.1007/BF01581046},
  doi          = {10.1007/BF01581046},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/JarvisT82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Korte82,
  author       = {Bernhard Korte},
  title        = {{XI.} International Symposium on Mathematical Programming - August
                  23-27, 1982 at the University of Bonn, W. Germany},
  journal      = {Math. Program.},
  volume       = {22},
  number       = {1},
  pages        = {122--123},
  year         = {1982},
  url          = {https://doi.org/10.1007/BF01581032},
  doi          = {10.1007/BF01581032},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Korte82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Lazimy82,
  author       = {Rafael Lazimy},
  title        = {Mixed-integer quadratic programming},
  journal      = {Math. Program.},
  volume       = {22},
  number       = {1},
  pages        = {332--349},
  year         = {1982},
  url          = {https://doi.org/10.1007/BF01581047},
  doi          = {10.1007/BF01581047},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Lazimy82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Naddef82,
  author       = {Denis Naddef},
  title        = {Rank of maximum matchings in a graph},
  journal      = {Math. Program.},
  volume       = {22},
  number       = {1},
  pages        = {52--70},
  year         = {1982},
  url          = {https://doi.org/10.1007/BF01581025},
  doi          = {10.1007/BF01581025},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Naddef82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Nakamura82,
  author       = {Masataka Nakamura},
  title        = {Boolean sublattices connected with minimization problems on matroids},
  journal      = {Math. Program.},
  volume       = {22},
  number       = {1},
  pages        = {117--120},
  year         = {1982},
  url          = {https://doi.org/10.1007/BF01581030},
  doi          = {10.1007/BF01581030},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Nakamura82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Orlin82,
  author       = {James B. Orlin},
  title        = {A polynomial algorithm for integer programming covering problems satisfying
                  the integer round-up property},
  journal      = {Math. Program.},
  volume       = {22},
  number       = {1},
  pages        = {231--235},
  year         = {1982},
  url          = {https://doi.org/10.1007/BF01581039},
  doi          = {10.1007/BF01581039},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Orlin82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/PicardQ82,
  author       = {Jean{-}Claude Picard and
                  Maurice Queyranne},
  title        = {On the structure of all minimum cuts in a network and applications},
  journal      = {Math. Program.},
  volume       = {22},
  number       = {1},
  pages        = {121},
  year         = {1982},
  url          = {https://doi.org/10.1007/BF01581031},
  doi          = {10.1007/BF01581031},
  timestamp    = {Tue, 26 Jun 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/PicardQ82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Spingarn82,
  author       = {Jonathan E. Spingarn},
  title        = {On optimality conditions for structured families of nonlinear programming
                  problems},
  journal      = {Math. Program.},
  volume       = {22},
  number       = {1},
  pages        = {82--92},
  year         = {1982},
  url          = {https://doi.org/10.1007/BF01581027},
  doi          = {10.1007/BF01581027},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Spingarn82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/TindW82,
  author       = {J{\o}rgen Tind and
                  Laurence A. Wolsey},
  title        = {On the use of penumbras in blocking and antiblocking theory},
  journal      = {Math. Program.},
  volume       = {22},
  number       = {1},
  pages        = {71--81},
  year         = {1982},
  url          = {https://doi.org/10.1007/BF01581026},
  doi          = {10.1007/BF01581026},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/TindW82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Zilinskas82,
  author       = {Antanas Zilinskas},
  title        = {Axiomatic approach to statistical models and their use in multimodal
                  optimization theory},
  journal      = {Math. Program.},
  volume       = {22},
  number       = {1},
  pages        = {104--116},
  year         = {1982},
  url          = {https://doi.org/10.1007/BF01581029},
  doi          = {10.1007/BF01581029},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Zilinskas82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics