Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/mp/BalasN89,
  author       = {Egon Balas and
                  Shu Ming Ng},
  title        = {On the set covering polytope: {II.} Lifting the facets with coefficients
                  in \{0, 1, 2\}},
  journal      = {Math. Program.},
  volume       = {45},
  number       = {1-3},
  pages        = {1--20},
  year         = {1989},
  url          = {https://doi.org/10.1007/BF01589093},
  doi          = {10.1007/BF01589093},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/BalasN89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/BalinskiD89,
  author       = {Michel L. Balinski and
                  Gabrielle Demange},
  title        = {Algorithms for proportional matrices in reals and integers},
  journal      = {Math. Program.},
  volume       = {45},
  number       = {1-3},
  pages        = {193--210},
  year         = {1989},
  url          = {https://doi.org/10.1007/BF01589103},
  doi          = {10.1007/BF01589103},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/BalinskiD89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/BarahonaM89,
  author       = {Francisco Barahona and
                  Ali Ridha Mahjoub},
  title        = {Facets of the balanced (acyclic) induced subgraph polytope},
  journal      = {Math. Program.},
  volume       = {45},
  number       = {1-3},
  pages        = {21--33},
  year         = {1989},
  url          = {https://doi.org/10.1007/BF01589094},
  doi          = {10.1007/BF01589094},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/BarahonaM89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/CameriniMV89,
  author       = {Paolo M. Camerini and
                  Francesco Maffioli and
                  Carlo Vercellis},
  title        = {Multi-constrained matroidal knapsack problems},
  journal      = {Math. Program.},
  volume       = {45},
  number       = {1-3},
  pages        = {211--231},
  year         = {1989},
  url          = {https://doi.org/10.1007/BF01589104},
  doi          = {10.1007/BF01589104},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/CameriniMV89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/CarpanetoFT89,
  author       = {Giorgio Carpaneto and
                  Matteo Fischetti and
                  Paolo Toth},
  title        = {New lower bounds for the Symmetric Travelling Salesman Problem},
  journal      = {Math. Program.},
  volume       = {45},
  number       = {1-3},
  pages        = {233--254},
  year         = {1989},
  url          = {https://doi.org/10.1007/BF01589105},
  doi          = {10.1007/BF01589105},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/CarpanetoFT89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Chopra89,
  author       = {Sunil Chopra},
  title        = {On ternary problems},
  journal      = {Math. Program.},
  volume       = {45},
  number       = {1-3},
  pages        = {35--47},
  year         = {1989},
  url          = {https://doi.org/10.1007/BF01589095},
  doi          = {10.1007/BF01589095},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Chopra89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/ColemanH89,
  author       = {Thomas F. Coleman and
                  Laurie A. Hulbert},
  title        = {A direct active set algorithm for large sparse quadratic programs
                  with simple bounds},
  journal      = {Math. Program.},
  volume       = {45},
  number       = {1-3},
  pages        = {373--406},
  year         = {1989},
  url          = {https://doi.org/10.1007/BF01589112},
  doi          = {10.1007/BF01589112},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/ColemanH89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/ConfortiL89,
  author       = {Michele Conforti and
                  Monique Laurent},
  title        = {On the geometric structure of independence systems},
  journal      = {Math. Program.},
  volume       = {45},
  number       = {1-3},
  pages        = {255--277},
  year         = {1989},
  url          = {https://doi.org/10.1007/BF01589106},
  doi          = {10.1007/BF01589106},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/ConfortiL89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/ConfortiR89,
  author       = {Michele Conforti and
                  M. R. Rao},
  title        = {Odd cycles and matrices with integrality properties},
  journal      = {Math. Program.},
  volume       = {45},
  number       = {1-3},
  pages        = {279--294},
  year         = {1989},
  url          = {https://doi.org/10.1007/BF01589107},
  doi          = {10.1007/BF01589107},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/ConfortiR89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/GalloS89,
  author       = {Giorgio Gallo and
                  Bruno Simeone},
  title        = {On the supermodular knapsack problem},
  journal      = {Math. Program.},
  volume       = {45},
  number       = {1-3},
  pages        = {295--309},
  year         = {1989},
  url          = {https://doi.org/10.1007/BF01589108},
  doi          = {10.1007/BF01589108},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mp/GalloS89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/GambleP89,
  author       = {A. B. Gamble and
                  William R. Pulleyblank},
  title        = {Forest covers and a polyhedral intersection theorem},
  journal      = {Math. Program.},
  volume       = {45},
  number       = {1-3},
  pages        = {49--58},
  year         = {1989},
  url          = {https://doi.org/10.1007/BF01589096},
  doi          = {10.1007/BF01589096},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/GambleP89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/GanJ89,
  author       = {Huiling Gan and
                  Ellis L. Johnson},
  title        = {Four problems on graphs with excluded minors},
  journal      = {Math. Program.},
  volume       = {45},
  number       = {1-3},
  pages        = {311--330},
  year         = {1989},
  url          = {https://doi.org/10.1007/BF01589109},
  doi          = {10.1007/BF01589109},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/GanJ89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/GilbertL89,
  author       = {Jean Charles Gilbert and
                  Claude Lemar{\'{e}}chal},
  title        = {Some numerical experiments with variable-storage quasi-Newton algorithms},
  journal      = {Math. Program.},
  volume       = {45},
  number       = {1-3},
  pages        = {407--435},
  year         = {1989},
  url          = {https://doi.org/10.1007/BF01589113},
  doi          = {10.1007/BF01589113},
  timestamp    = {Sat, 30 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/GilbertL89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/GillMSW89,
  author       = {Philip E. Gill and
                  Walter Murray and
                  Michael A. Saunders and
                  Margaret H. Wright},
  title        = {A practical anti-cycling procedure for linearly constrained optimization},
  journal      = {Math. Program.},
  volume       = {45},
  number       = {1-3},
  pages        = {437--474},
  year         = {1989},
  url          = {https://doi.org/10.1007/BF01589114},
  doi          = {10.1007/BF01589114},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/GillMSW89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/GouldR89,
  author       = {Nicholas I. M. Gould and
                  John K. Reid},
  title        = {New crash procedures for large systems of linear constraints},
  journal      = {Math. Program.},
  volume       = {45},
  number       = {1-3},
  pages        = {475--501},
  year         = {1989},
  url          = {https://doi.org/10.1007/BF01589115},
  doi          = {10.1007/BF01589115},
  timestamp    = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/GouldR89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/GrotschelW89,
  author       = {Martin Gr{\"{o}}tschel and
                  Yoshiko Wakabayashi},
  title        = {A cutting plane algorithm for a clustering problem},
  journal      = {Math. Program.},
  volume       = {45},
  number       = {1-3},
  pages        = {59--96},
  year         = {1989},
  url          = {https://doi.org/10.1007/BF01589097},
  doi          = {10.1007/BF01589097},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mp/GrotschelW89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Laurent89,
  author       = {Monique Laurent},
  title        = {A generalization of antiwebs to independence systems and their canonical
                  facets},
  journal      = {Math. Program.},
  volume       = {45},
  number       = {1-3},
  pages        = {97--108},
  year         = {1989},
  url          = {https://doi.org/10.1007/BF01589098},
  doi          = {10.1007/BF01589098},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Laurent89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/LeungMV89,
  author       = {Janny M. Y. Leung and
                  Thomas L. Magnanti and
                  Rita Vachani},
  title        = {Facets and algorithms for capacitated lot sizing},
  journal      = {Math. Program.},
  volume       = {45},
  number       = {1-3},
  pages        = {331--359},
  year         = {1989},
  url          = {https://doi.org/10.1007/BF01589110},
  doi          = {10.1007/BF01589110},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/LeungMV89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/LiuN89,
  author       = {Dong C. Liu and
                  Jorge Nocedal},
  title        = {On the limited memory {BFGS} method for large scale optimization},
  journal      = {Math. Program.},
  volume       = {45},
  number       = {1-3},
  pages        = {503--528},
  year         = {1989},
  url          = {https://doi.org/10.1007/BF01589116},
  doi          = {10.1007/BF01589116},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mp/LiuN89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Minoux89,
  author       = {Michel Minoux},
  title        = {Solving combinatorial problems with combined Min-Max-Min-Sum objective
                  and applications},
  journal      = {Math. Program.},
  volume       = {45},
  number       = {1-3},
  pages        = {361--372},
  year         = {1989},
  url          = {https://doi.org/10.1007/BF01589111},
  doi          = {10.1007/BF01589111},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Minoux89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Naddef89,
  author       = {Denis Naddef},
  title        = {The hirsch conjecture is true for (0, 1)-polytopes},
  journal      = {Math. Program.},
  volume       = {45},
  number       = {1-3},
  pages        = {109--110},
  year         = {1989},
  url          = {https://doi.org/10.1007/BF01589099},
  doi          = {10.1007/BF01589099},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Naddef89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/NashS89,
  author       = {Stephen G. Nash and
                  Ariela Sofer},
  title        = {Block truncated-Newton methods for parallel optimization},
  journal      = {Math. Program.},
  volume       = {45},
  number       = {1-3},
  pages        = {529--546},
  year         = {1989},
  url          = {https://doi.org/10.1007/BF01589117},
  doi          = {10.1007/BF01589117},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/NashS89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/NobiliS89,
  author       = {Paolo Nobili and
                  Antonio Sassano},
  title        = {Facets and lifting procedures for the set covering polytope},
  journal      = {Math. Program.},
  volume       = {45},
  number       = {1-3},
  pages        = {111--137},
  year         = {1989},
  url          = {https://doi.org/10.1007/BF01589100},
  doi          = {10.1007/BF01589100},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mp/NobiliS89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Padberg89,
  author       = {Manfred Padberg},
  title        = {The boolean quadric polytope: Some characteristics, facets and relatives},
  journal      = {Math. Program.},
  volume       = {45},
  number       = {1-3},
  pages        = {139--172},
  year         = {1989},
  url          = {https://doi.org/10.1007/BF01589101},
  doi          = {10.1007/BF01589101},
  timestamp    = {Sat, 30 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Padberg89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Powell89,
  author       = {M. J. D. Powell},
  title        = {A tolerant algorithm for linearly constrained optimization calculations},
  journal      = {Math. Program.},
  volume       = {45},
  number       = {1-3},
  pages        = {547--566},
  year         = {1989},
  url          = {https://doi.org/10.1007/BF01589118},
  doi          = {10.1007/BF01589118},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Powell89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Wolsey89,
  author       = {Laurence A. Wolsey},
  title        = {Strong formulations for mixed integer programming: {A} survey},
  journal      = {Math. Program.},
  volume       = {45},
  number       = {1-3},
  pages        = {173--191},
  year         = {1989},
  url          = {https://doi.org/10.1007/BF01589102},
  doi          = {10.1007/BF01589102},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Wolsey89.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.