Search dblp for Publications

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

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

> Home > Search

download as .bib file

@article{DBLP:journals/mp/AhrensF75,
  author       = {Joachim H. Ahrens and
                  Gerd Finke},
  title        = {Degeneracy in fixed cost transportation problems},
  journal      = {Math. Program.},
  volume       = {8},
  number       = {1},
  pages        = {369--374},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01580452},
  doi          = {10.1007/BF01580452},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/AhrensF75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Balas75,
  author       = {Egon Balas},
  title        = {Facets of the knapsack polytope},
  journal      = {Math. Program.},
  volume       = {8},
  number       = {1},
  pages        = {146--164},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01580440},
  doi          = {10.1007/BF01580440},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Balas75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/BellF75,
  author       = {David E. Bell and
                  Marshall L. Fisher},
  title        = {Improved integer programming bounds using intersections of corner
                  polyhedra},
  journal      = {Math. Program.},
  volume       = {8},
  number       = {1},
  pages        = {345--368},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01580451},
  doi          = {10.1007/BF01580451},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/BellF75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/BrearleyMW75,
  author       = {A. L. Brearley and
                  Gautam Mitra and
                  H. Paul Williams},
  title        = {Analysis of mathematical programming problems prior to applying the
                  simplex algorithm},
  journal      = {Math. Program.},
  volume       = {8},
  number       = {1},
  pages        = {54--83},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01580428},
  doi          = {10.1007/BF01580428},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/BrearleyMW75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Buckley75,
  author       = {A. Buckley},
  title        = {An alternate implementation of Goldfarb's minimization algorithm},
  journal      = {Math. Program.},
  volume       = {8},
  number       = {1},
  pages        = {207--231},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01580443},
  doi          = {10.1007/BF01580443},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Buckley75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/EckerK75,
  author       = {Joseph G. Ecker and
                  Issoufou Kouada},
  title        = {Finding efficient points for linear multiple objective programs},
  journal      = {Math. Program.},
  volume       = {8},
  number       = {1},
  pages        = {375--377},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01580453},
  doi          = {10.1007/BF01580453},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/EckerK75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/ElzingaM75,
  author       = {Jack Elzinga and
                  Thomas G. Moore},
  title        = {A central cutting plane algorithm for the convex programming problem},
  journal      = {Math. Program.},
  volume       = {8},
  number       = {1},
  pages        = {134--145},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01580439},
  doi          = {10.1007/BF01580439},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/ElzingaM75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/FayardP75,
  author       = {Didier Fayard and
                  G{\'{e}}rard Plateau},
  title        = {Resolution of the 0-1 knapsack problem: Comparison of methods},
  journal      = {Math. Program.},
  volume       = {8},
  number       = {1},
  pages        = {272--307},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01580448},
  doi          = {10.1007/BF01580448},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/FayardP75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Glover75a,
  author       = {Fred W. Glover},
  title        = {New results on equivalent integer programming formulations},
  journal      = {Math. Program.},
  volume       = {8},
  number       = {1},
  pages        = {84--90},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01580429},
  doi          = {10.1007/BF01580429},
  timestamp    = {Tue, 04 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Glover75a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/GrotschelP75,
  author       = {Martin Gr{\"{o}}tschel and
                  Manfred W. Padberg},
  title        = {Partial linear characterizations of the asymmetric travelling salesman
                  polytope},
  journal      = {Math. Program.},
  volume       = {8},
  number       = {1},
  pages        = {378--381},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01580454},
  doi          = {10.1007/BF01580454},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/GrotschelP75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/HammerJP75,
  author       = {Peter L. Hammer and
                  Ellis L. Johnson and
                  Uri N. Peled},
  title        = {Facet of regular 0-1 polytopes},
  journal      = {Math. Program.},
  volume       = {8},
  number       = {1},
  pages        = {179--206},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01580442},
  doi          = {10.1007/BF01580442},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/HammerJP75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Herman75,
  author       = {Gabor T. Herman},
  title        = {A relaxation method for reconstructing objects from noisy X-rays},
  journal      = {Math. Program.},
  volume       = {8},
  number       = {1},
  pages        = {1--19},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01580425},
  doi          = {10.1007/BF01580425},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Herman75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/HowsonS75,
  author       = {H. R. Howson and
                  N. G. F. Sancho},
  title        = {A new algorithm for the solution of multi-state dynamic programming
                  problems},
  journal      = {Math. Program.},
  volume       = {8},
  number       = {1},
  pages        = {104--116},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01580431},
  doi          = {10.1007/BF01580431},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/HowsonS75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Huard75,
  author       = {P. Huard},
  title        = {Optimization algorithms and point-to-set-maps},
  journal      = {Math. Program.},
  volume       = {8},
  number       = {1},
  pages        = {308--331},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01580449},
  doi          = {10.1007/BF01580449},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Huard75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/LehmannO75,
  author       = {R. Lehmann and
                  Werner Oettli},
  title        = {The theorem of the alternative, the key-theorem, and the vector-maximum
                  problem},
  journal      = {Math. Program.},
  volume       = {8},
  number       = {1},
  pages        = {332--344},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01580450},
  doi          = {10.1007/BF01580450},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/LehmannO75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Mifflin75a,
  author       = {Robert Mifflin},
  title        = {Convergence bounds for nonlinear programming algorithms},
  journal      = {Math. Program.},
  volume       = {8},
  number       = {1},
  pages        = {251--271},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01580447},
  doi          = {10.1007/BF01580447},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Mifflin75a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/NemhauserT75,
  author       = {George L. Nemhauser and
                  Leslie E. Trotter Jr.},
  title        = {Vertex packings: Structural properties and algorithms},
  journal      = {Math. Program.},
  volume       = {8},
  number       = {1},
  pages        = {232--248},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01580444},
  doi          = {10.1007/BF01580444},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mp/NemhauserT75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Pyne75,
  author       = {David A. Pyne},
  title        = {On interior and convexity conditions, development of dual problems
                  and saddlepoint optimality criteria in abstract mathematical programming},
  journal      = {Math. Program.},
  volume       = {8},
  number       = {1},
  pages        = {125--133},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01580438},
  doi          = {10.1007/BF01580438},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Pyne75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/RossS75,
  author       = {G. Terry Ross and
                  Richard M. Soland},
  title        = {A branch and bound algorithm for the generalized assignment problem},
  journal      = {Math. Program.},
  volume       = {8},
  number       = {1},
  pages        = {91--103},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01580430},
  doi          = {10.1007/BF01580430},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/RossS75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Sakarovitch75,
  author       = {M. Sakarovitch},
  title        = {Quasi-balanced matrices},
  journal      = {Math. Program.},
  volume       = {8},
  number       = {1},
  pages        = {382--386},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01580455},
  doi          = {10.1007/BF01580455},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Sakarovitch75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Salzborn75,
  author       = {Franz J. M. Salzborn},
  title        = {Break minimization},
  journal      = {Math. Program.},
  volume       = {8},
  number       = {1},
  pages        = {43--53},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01580427},
  doi          = {10.1007/BF01580427},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Salzborn75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/WhiteG75,
  author       = {Lee J. White and
                  Mark Lee Gillenson},
  title        = {An efficient algorithm for minimum\emph{k}-covers in weighted graphs},
  journal      = {Math. Program.},
  volume       = {8},
  number       = {1},
  pages        = {20--42},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01580426},
  doi          = {10.1007/BF01580426},
  timestamp    = {Tue, 14 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/WhiteG75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Wolsey75,
  author       = {Laurence A. Wolsey},
  title        = {Faces for a linear inequality in 0-1 variables},
  journal      = {Math. Program.},
  volume       = {8},
  number       = {1},
  pages        = {165--178},
  year         = {1975},
  url          = {https://doi.org/10.1007/BF01580441},
  doi          = {10.1007/BF01580441},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Wolsey75.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.