default search action
Search dblp for Publications
export results for "toc:db/journals/mp/mp98.bht:"
@article{DBLP:journals/mp/Atamturk03, author = {Alper Atamt{\"{u}}rk}, title = {On the facets of the mixed-integer knapsack polyhedron}, journal = {Math. Program.}, volume = {98}, number = {1-3}, pages = {145--175}, year = {2003}, url = {https://doi.org/10.1007/s10107-003-0400-z}, doi = {10.1007/S10107-003-0400-Z}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Atamturk03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/BertsimasS03, author = {Dimitris Bertsimas and Melvyn Sim}, title = {Robust discrete optimization and network flows}, journal = {Math. Program.}, volume = {98}, number = {1-3}, pages = {49--71}, year = {2003}, url = {https://doi.org/10.1007/s10107-003-0396-4}, doi = {10.1007/S10107-003-0396-4}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/BertsimasS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/BontridderHHHLRS03, author = {Koen M. J. De Bontridder and Bjarni V. Halld{\'{o}}rsson and Magn{\'{u}}s M. Halld{\'{o}}rsson and Cor A. J. Hurkens and Jan Karel Lenstra and R. Ravi and Leen Stougie}, title = {Approximation algorithms for the test cover problem}, journal = {Math. Program.}, volume = {98}, number = {1-3}, pages = {477--491}, year = {2003}, url = {https://doi.org/10.1007/s10107-003-0414-6}, doi = {10.1007/S10107-003-0414-6}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/BontridderHHHLRS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/BorosEGK03, author = {Endre Boros and Khaled M. Elbassioni and Vladimir Gurvich and Leonid Khachiyan}, title = {Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices}, journal = {Math. Program.}, volume = {98}, number = {1-3}, pages = {355--368}, year = {2003}, url = {https://doi.org/10.1007/s10107-003-0408-4}, doi = {10.1007/S10107-003-0408-4}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/BorosEGK03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/BuchheimJ03, author = {Christoph Buchheim and Michael J{\"{u}}nger}, title = {Detecting symmetries by branch {\&} cut}, journal = {Math. Program.}, volume = {98}, number = {1-3}, pages = {369--384}, year = {2003}, url = {https://doi.org/10.1007/s10107-003-0409-3}, doi = {10.1007/S10107-003-0409-3}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/BuchheimJ03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/BurkardB03, author = {Rainer E. Burkard and Peter Butkovic}, title = {Max algebra and the linear assignment problem}, journal = {Math. Program.}, volume = {98}, number = {1-3}, pages = {415--429}, year = {2003}, url = {https://doi.org/10.1007/s10107-003-0411-9}, doi = {10.1007/S10107-003-0411-9}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/BurkardB03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/CapraraMT03, author = {Alberto Caprara and Michele Monaci and Paolo Toth}, title = {Models and algorithms for a staff scheduling problem}, journal = {Math. Program.}, volume = {98}, number = {1-3}, pages = {445--476}, year = {2003}, url = {https://doi.org/10.1007/s10107-003-0413-7}, doi = {10.1007/S10107-003-0413-7}, timestamp = {Sat, 16 Sep 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/CapraraMT03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Ceria03, author = {Sebasti{\'{a}}n Ceria}, title = {Lift-and-project cuts and perfect graphs}, journal = {Math. Program.}, volume = {98}, number = {1-3}, pages = {309--317}, year = {2003}, url = {https://doi.org/10.1007/s10107-003-0406-6}, doi = {10.1007/S10107-003-0406-6}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Ceria03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/ChristofidesCC03, author = {Simon Christofides and Alexander Christofides and Nicos Christofides}, title = {The design of corporate tax structures}, journal = {Math. Program.}, volume = {98}, number = {1-3}, pages = {493--510}, year = {2003}, url = {https://doi.org/10.1007/s10107-003-0416-4}, doi = {10.1007/S10107-003-0416-4}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/ChristofidesCC03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/CornuejolsP03, author = {G{\'{e}}rard Cornu{\'{e}}jols and William R. Pulleyblank}, title = {Integer programming}, journal = {Math. Program.}, volume = {98}, number = {1-3}, pages = {1--2}, year = {2003}, url = {https://doi.org/10.1007/s10107-003-0417-3}, doi = {10.1007/S10107-003-0417-3}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/CornuejolsP03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/EastonHL03, author = {Todd Easton and Kevin Hooker and Eva K. Lee}, title = {Facets of the independent set polytope}, journal = {Math. Program.}, volume = {98}, number = {1-3}, pages = {177--199}, year = {2003}, url = {https://doi.org/10.1007/s10107-003-0401-y}, doi = {10.1007/S10107-003-0401-Y}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/EastonHL03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/FischettiL03, author = {Matteo Fischetti and Andrea Lodi}, title = {Local branching}, journal = {Math. Program.}, volume = {98}, number = {1-3}, pages = {23--47}, year = {2003}, url = {https://doi.org/10.1007/s10107-003-0395-5}, doi = {10.1007/S10107-003-0395-5}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/FischettiL03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/KoppeW03, author = {Matthias K{\"{o}}ppe and Robert Weismantel}, title = {An algorithm for mixed integer optimization}, journal = {Math. Program.}, volume = {98}, number = {1-3}, pages = {281--307}, year = {2003}, url = {https://doi.org/10.1007/s10107-003-0405-7}, doi = {10.1007/S10107-003-0405-7}, timestamp = {Thu, 08 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/KoppeW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/KorachS03, author = {Ephraim Korach and Michal Stern}, title = {The clustering matroid and the optimal clustering tree}, journal = {Math. Program.}, volume = {98}, number = {1-3}, pages = {385--414}, year = {2003}, url = {https://doi.org/10.1007/s10107-003-0410-x}, doi = {10.1007/S10107-003-0410-X}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/KorachS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Letchford03, author = {Adam N. Letchford}, title = {Binary clutter inequalities for integer programs}, journal = {Math. Program.}, volume = {98}, number = {1-3}, pages = {201--221}, year = {2003}, url = {https://doi.org/10.1007/s10107-003-0402-x}, doi = {10.1007/S10107-003-0402-X}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/Letchford03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/LiptakT03, author = {L{\'{a}}szl{\'{o}} Lipt{\'{a}}k and Levent Tun{\c{c}}el}, title = {The stable set problem and the lift-and-project ranks of graphs}, journal = {Math. Program.}, volume = {98}, number = {1-3}, pages = {319--353}, year = {2003}, url = {https://doi.org/10.1007/s10107-003-0407-5}, doi = {10.1007/S10107-003-0407-5}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/LiptakT03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Margot03, author = {Fran{\c{c}}ois Margot}, title = {Exploiting orbits in symmetric {ILP}}, journal = {Math. Program.}, volume = {98}, number = {1-3}, pages = {3--21}, year = {2003}, url = {https://doi.org/10.1007/s10107-003-0394-6}, doi = {10.1007/S10107-003-0394-6}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Margot03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/MillerW03, author = {Andrew J. Miller and Laurence A. Wolsey}, title = {Tight formulations for some simple mixed integer programs and convex objective integer programs}, journal = {Math. Program.}, volume = {98}, number = {1-3}, pages = {73--88}, year = {2003}, url = {https://doi.org/10.1007/s10107-003-0397-3}, doi = {10.1007/S10107-003-0397-3}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/MillerW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/NaddefW03, author = {Denis Naddef and Emmanuel Wild}, title = {The domino inequalities: facets for the symmetric traveling salesman polytope}, journal = {Math. Program.}, volume = {98}, number = {1-3}, pages = {223--251}, year = {2003}, url = {https://doi.org/10.1007/s10107-003-0403-9}, doi = {10.1007/S10107-003-0403-9}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/NaddefW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/RalphsLS03, author = {Ted K. Ralphs and Laszlo Lad{\'{a}}nyi and Matthew J. Saltzman}, title = {Parallel branch, cut, and price for large-scale discrete optimization}, journal = {Math. Program.}, volume = {98}, number = {1-3}, pages = {253--280}, year = {2003}, url = {https://doi.org/10.1007/s10107-003-0404-8}, doi = {10.1007/S10107-003-0404-8}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/RalphsLS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/RichardFN03, author = {Jean{-}Philippe P. Richard and Ismael R. de Farias Jr. and George L. Nemhauser}, title = {Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms}, journal = {Math. Program.}, volume = {98}, number = {1-3}, pages = {89--113}, year = {2003}, url = {https://doi.org/10.1007/s10107-003-0398-2}, doi = {10.1007/S10107-003-0398-2}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/RichardFN03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/RichardFN03a, author = {Jean{-}Philippe P. Richard and Ismael R. de Farias Jr. and George L. Nemhauser}, title = {Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting}, journal = {Math. Program.}, volume = {98}, number = {1-3}, pages = {115--143}, year = {2003}, url = {https://doi.org/10.1007/s10107-003-0399-1}, doi = {10.1007/S10107-003-0399-1}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/RichardFN03a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Serafini03, author = {Paolo Serafini}, title = {Asymptotic scheduling}, journal = {Math. Program.}, volume = {98}, number = {1-3}, pages = {431--444}, year = {2003}, url = {https://doi.org/10.1007/s10107-003-0412-8}, doi = {10.1007/S10107-003-0412-8}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Serafini03.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.