Search dblp for Publications

export results for "toc:db/journals/mpc/mpc3.bht:"

 download as .bib file

@article{DBLP:journals/mpc/0003RV11,
  author       = {Dirk M{\"{u}}ller and
                  Klaus Radke and
                  Jens Vygen},
  title        = {Faster min-max resource sharing in theory and practice},
  journal      = {Math. Program. Comput.},
  volume       = {3},
  number       = {1},
  pages        = {1--35},
  year         = {2011},
  url          = {https://doi.org/10.1007/s12532-011-0023-y},
  doi          = {10.1007/S12532-011-0023-Y},
  timestamp    = {Sat, 20 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mpc/0003RV11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mpc/BeckerCG11,
  author       = {Stephen Becker and
                  Emmanuel J. Cand{\`{e}}s and
                  Michael C. Grant},
  title        = {Templates for convex cone problems with applications to sparse signal
                  recovery},
  journal      = {Math. Program. Comput.},
  volume       = {3},
  number       = {3},
  pages        = {165--218},
  year         = {2011},
  url          = {https://doi.org/10.1007/s12532-011-0029-5},
  doi          = {10.1007/S12532-011-0029-5},
  timestamp    = {Sat, 20 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mpc/BeckerCG11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mpc/BomzeJR11,
  author       = {Immanuel M. Bomze and
                  Florian Jarre and
                  Franz Rendl},
  title        = {Quadratic factorization heuristics for copositive programming},
  journal      = {Math. Program. Comput.},
  volume       = {3},
  number       = {1},
  pages        = {37--57},
  year         = {2011},
  url          = {https://doi.org/10.1007/s12532-011-0022-z},
  doi          = {10.1007/S12532-011-0022-Z},
  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mpc/BomzeJR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mpc/CapraraORST11,
  author       = {Alberto Caprara and
                  Marcus Oswald and
                  Gerhard Reinelt and
                  Robert Schwarz and
                  Emiliano Traversi},
  title        = {Optimal linear arrangements using betweenness variables},
  journal      = {Math. Program. Comput.},
  volume       = {3},
  number       = {3},
  pages        = {261--280},
  year         = {2011},
  url          = {https://doi.org/10.1007/s12532-011-0027-7},
  doi          = {10.1007/S12532-011-0027-7},
  timestamp    = {Tue, 29 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mpc/CapraraORST11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mpc/CornuejolsN11,
  author       = {G{\'{e}}rard Cornu{\'{e}}jols and
                  Giacomo Nannicini},
  title        = {Practical strategies for generating rank-1 split cuts in mixed-integer
                  linear programming},
  journal      = {Math. Program. Comput.},
  volume       = {3},
  number       = {4},
  pages        = {281--318},
  year         = {2011},
  url          = {https://doi.org/10.1007/s12532-011-0028-6},
  doi          = {10.1007/S12532-011-0028-6},
  timestamp    = {Sat, 20 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mpc/CornuejolsN11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mpc/FischettiS11,
  author       = {Matteo Fischetti and
                  Domenico Salvagnin},
  title        = {A relax-and-cut framework for Gomory mixed-integer cuts},
  journal      = {Math. Program. Comput.},
  volume       = {3},
  number       = {2},
  pages        = {79--102},
  year         = {2011},
  url          = {https://doi.org/10.1007/s12532-011-0024-x},
  doi          = {10.1007/S12532-011-0024-X},
  timestamp    = {Sat, 20 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mpc/FischettiS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mpc/FortiniLLW11,
  author       = {Matteo Fortini and
                  Adam N. Letchford and
                  Andrea Lodi and
                  Klaus Michael Wenger},
  title        = {Computing compatible tours for the symmetric traveling salesman problem},
  journal      = {Math. Program. Comput.},
  volume       = {3},
  number       = {1},
  pages        = {59--78},
  year         = {2011},
  url          = {https://doi.org/10.1007/s12532-010-0021-5},
  doi          = {10.1007/S12532-010-0021-5},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mpc/FortiniLLW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mpc/HartWW11,
  author       = {William E. Hart and
                  Jean{-}Paul Watson and
                  David L. Woodruff},
  title        = {Pyomo: modeling and solving mathematical programs in Python},
  journal      = {Math. Program. Comput.},
  volume       = {3},
  number       = {3},
  pages        = {219--260},
  year         = {2011},
  url          = {https://doi.org/10.1007/s12532-011-0026-8},
  doi          = {10.1007/S12532-011-0026-8},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mpc/HartWW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mpc/KirchesBSS11,
  author       = {Christian Kirches and
                  Hans Georg Bock and
                  Johannes P. Schl{\"{o}}der and
                  Sebastian Sager},
  title        = {A factorization with update procedures for a {KKT} matrix arising
                  in direct optimal control},
  journal      = {Math. Program. Comput.},
  volume       = {3},
  number       = {4},
  pages        = {319--348},
  year         = {2011},
  url          = {https://doi.org/10.1007/s12532-011-0030-z},
  doi          = {10.1007/S12532-011-0030-Z},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mpc/KirchesBSS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mpc/KochAABBBDGGHLMRSSW11,
  author       = {Thorsten Koch and
                  Tobias Achterberg and
                  Erling Andersen and
                  Oliver Bastert and
                  Timo Berthold and
                  Robert E. Bixby and
                  Emilie Danna and
                  Gerald Gamrath and
                  Ambros M. Gleixner and
                  Stefan Heinz and
                  Andrea Lodi and
                  Hans D. Mittelmann and
                  Ted K. Ralphs and
                  Domenico Salvagnin and
                  Daniel E. Steffy and
                  Kati Wolter},
  title        = {{MIPLIB} 2010},
  journal      = {Math. Program. Comput.},
  volume       = {3},
  number       = {2},
  pages        = {103--163},
  year         = {2011},
  url          = {https://doi.org/10.1007/s12532-011-0025-9},
  doi          = {10.1007/S12532-011-0025-9},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mpc/KochAABBBDGGHLMRSSW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mpc/LibertiMN11,
  author       = {Leo Liberti and
                  Nenad Mladenovic and
                  Giacomo Nannicini},
  title        = {A recipe for finding good solutions to MINLPs},
  journal      = {Math. Program. Comput.},
  volume       = {3},
  number       = {4},
  pages        = {349--390},
  year         = {2011},
  url          = {https://doi.org/10.1007/s12532-011-0031-y},
  doi          = {10.1007/S12532-011-0031-Y},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mpc/LibertiMN11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics