![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "toc:db/conf/ipco/ipco2008.bht:"
@inproceedings{DBLP:conf/ipco/ArcherK08, author = {Aaron Archer and Shankar Krishnan}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {Importance Sampling via Load-Balanced Facility Location}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {316--330}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_22}, doi = {10.1007/978-3-540-68891-4\_22}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/ipco/ArcherK08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/ArmbrusterFHM08, author = {Michael Armbruster and Marzena F{\"{u}}genschuh and Christoph Helmberg and Alexander Martin}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {112--124}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_8}, doi = {10.1007/978-3-540-68891-4\_8}, timestamp = {Wed, 11 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ipco/ArmbrusterFHM08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/BergerBGS08, author = {Andr{\'{e}} Berger and Vincenzo Bonifaci and Fabrizio Grandoni and Guido Sch{\"{a}}fer}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {273--287}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_19}, doi = {10.1007/978-3-540-68891-4\_19}, timestamp = {Mon, 11 Dec 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ipco/BergerBGS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/BernathK08, author = {Attila Bern{\'{a}}th and Tam{\'{a}}s Kir{\'{a}}ly}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {A New Approach to Splitting-Off}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {401--415}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_28}, doi = {10.1007/978-3-540-68891-4\_28}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/BernathK08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/BertsimasLO08, author = {Dimitris Bertsimas and Guglielmo Lulli and Amedeo R. Odoni}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {The Air Traffic Flow Management Problem: An Integer Optimization Approach}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {34--46}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_3}, doi = {10.1007/978-3-540-68891-4\_3}, timestamp = {Wed, 03 Jan 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ipco/BertsimasLO08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/CarnesS08, author = {Tim Carnes and David B. Shmoys}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {Primal-Dual Schema for Capacitated Covering Problems}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {288--302}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_20}, doi = {10.1007/978-3-540-68891-4\_20}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/CarnesS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/ChakrabartyDV08, author = {Deeparnab Chakrabarty and Nikhil R. Devanur and Vijay V. Vazirani}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {344--358}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_24}, doi = {10.1007/978-3-540-68891-4\_24}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/ChakrabartyDV08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/ConfortiSW08, author = {Michele Conforti and Marco Di Summa and Laurence A. Wolsey}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {The Mixing Set with Divisible Capacities}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {435--449}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_30}, doi = {10.1007/978-3-540-68891-4\_30}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/ConfortiSW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/DeyW08, author = {Santanu S. Dey and Laurence A. Wolsey}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {463--475}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_32}, doi = {10.1007/978-3-540-68891-4\_32}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/DeyW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/Espinoza08, author = {Daniel G. Espinoza}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {Computing with Multi-row Gomory Cuts}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {214--224}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_15}, doi = {10.1007/978-3-540-68891-4\_15}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/Espinoza08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/Fleiner08, author = {Tam{\'{a}}s Fleiner}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {The Stable Roommates Problem with Choice Functions}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {385--400}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_27}, doi = {10.1007/978-3-540-68891-4\_27}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/Fleiner08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/GeorgiouMT08, author = {Konstantinos Georgiou and Avner Magen and Iannis Tourlakis}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {140--153}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_10}, doi = {10.1007/978-3-540-68891-4\_10}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/GeorgiouMT08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/GuanM08, author = {Yongpei Guan and Andrew Miller}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {450--462}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_31}, doi = {10.1007/978-3-540-68891-4\_31}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/GuanM08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/GunlukL08, author = {Oktay G{\"{u}}nl{\"{u}}k and Jeff T. Linderoth}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {1--16}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_1}, doi = {10.1007/978-3-540-68891-4\_1}, timestamp = {Thu, 24 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/GunlukL08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/HalldorssonKS08, author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and Guy Kortsarz and Maxim Sviridenko}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {Min Sum Edge Coloring in Multigraphs Via Configuration {LP}}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {359--373}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_25}, doi = {10.1007/978-3-540-68891-4\_25}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ipco/HalldorssonKS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/JansenS08, author = {Klaus Jansen and Roberto Solis{-}Oba}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {A Polynomial Time Approximation Scheme for the Square Packing Problem}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {184--198}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_13}, doi = {10.1007/978-3-540-68891-4\_13}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/JansenS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/Kawarabayashi08, author = {Ken{-}ichi Kawarabayashi}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {An Improved Algorithm for Finding Cycles Through Elements}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {374--384}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_26}, doi = {10.1007/978-3-540-68891-4\_26}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/Kawarabayashi08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/KawarabayashiK08, author = {Ken{-}ichi Kawarabayashi and Yusuke Kobayashi}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {The Induced Disjoint Paths Problem}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {47--61}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_4}, doi = {10.1007/978-3-540-68891-4\_4}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/KawarabayashiK08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/KiralyLS08, author = {Tam{\'{a}}s Kir{\'{a}}ly and Lap Chi Lau and Mohit Singh}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {Degree Bounded Matroids and Submodular Flows}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {259--272}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_18}, doi = {10.1007/978-3-540-68891-4\_18}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/KiralyLS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/LetchfordS08, author = {Adam N. Letchford and Michael Malmros S{\o}rensen}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {Binary Positive Semidefinite Matrices and Associated Integer Polytopes}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {125--139}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_9}, doi = {10.1007/978-3-540-68891-4\_9}, timestamp = {Sat, 04 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ipco/LetchfordS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/MartensM08, author = {Maren Martens and S. Thomas McCormick}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {A Polynomial Algorithm for Weighted Abstract Flow}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {97--111}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_7}, doi = {10.1007/978-3-540-68891-4\_7}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/MartensM08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/MunagalaS08, author = {Kamesh Munagala and Peng Shi}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {The Stochastic Machine Replenishment Problem}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {169--183}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_12}, doi = {10.1007/978-3-540-68891-4\_12}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/MunagalaS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/NagarajanS08, author = {Viswanath Nagarajan and Maxim Sviridenko}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {Tight Bounds for Permutation Flow Shop Scheduling}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {154--168}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_11}, doi = {10.1007/978-3-540-68891-4\_11}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/NagarajanS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/NagarajanW08, author = {Chandrashekhar Nagarajan and David P. Williamson}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {Offline and Online Facility Leasing}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {303--315}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_21}, doi = {10.1007/978-3-540-68891-4\_21}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/NagarajanW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/OrioloPS08, author = {Gianpaolo Oriolo and Ugo Pietropaoli and Gautier Stauffer}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {77--96}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_6}, doi = {10.1007/978-3-540-68891-4\_6}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/OrioloPS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/Orlin08, author = {James B. Orlin}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {A Fast, Simpler Algorithm for the Matroid Parity Problem}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {240--258}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_17}, doi = {10.1007/978-3-540-68891-4\_17}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/Orlin08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/OstrowskiLRS08, author = {James Ostrowski and Jeff T. Linderoth and Fabrizio Rossi and Stefano Smriglio}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {Constraint Orbital Branching}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {225--239}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_16}, doi = {10.1007/978-3-540-68891-4\_16}, timestamp = {Thu, 24 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/OstrowskiLRS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/SaxenaBL08, author = {Anureet Saxena and Pierre Bonami and Jon Lee}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {17--33}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_2}, doi = {10.1007/978-3-540-68891-4\_2}, timestamp = {Mon, 12 Feb 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ipco/SaxenaBL08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/ShmoysT08, author = {David B. Shmoys and Kunal Talwar}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {A Constant Approximation Algorithm for the a prioriTraveling Salesman Problem}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {331--343}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_23}, doi = {10.1007/978-3-540-68891-4\_23}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/ShmoysT08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/Takazawa08, author = {Kenjiro Takazawa}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {A Weighted Kt, t-Free t-Factor Algorithm for Bipartite Graphs}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {62--76}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_5}, doi = {10.1007/978-3-540-68891-4\_5}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/Takazawa08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/VielmaN08, author = {Juan Pablo Vielma and George L. Nemhauser}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {199--213}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_14}, doi = {10.1007/978-3-540-68891-4\_14}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/VielmaN08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/ZanetteFB08, author = {Arrigo Zanette and Matteo Fischetti and Egon Balas}, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {Can Pure Cutting Plane Algorithms Work?}, booktitle = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, pages = {416--434}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4\_29}, doi = {10.1007/978-3-540-68891-4\_29}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/ZanetteFB08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/ipco/2008, editor = {Andrea Lodi and Alessandro Panconesi and Giovanni Rinaldi}, title = {Integer Programming and Combinatorial Optimization, 13th International Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5035}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-68891-4}, doi = {10.1007/978-3-540-68891-4}, isbn = {978-3-540-68886-0}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/2008.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.