Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/ipco/ipco2001.bht:"
download as .bib file
@inproceedings{DBLP:conf/ipco/Archer01,
author = {Aaron Archer},
editor = {Karen I. Aardal and
Bert Gerards},
title = {Two {O} (log\({}^{\mbox{*}}\) k)-Approximation Algorithms for the
Asymmetric k-Center Problem},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {1--14},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_1},
doi = {10.1007/3-540-45535-3\_1},
timestamp = {Tue, 25 Jul 2023 13:14:28 +0200},
biburl = {https://dblp.org/rec/conf/ipco/Archer01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/AzarR01,
author = {Yossi Azar and
Oded Regev},
editor = {Karen I. Aardal and
Bert Gerards},
title = {Strongly Polynomial Algorithms for the Unsplittable Flow Problem},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {15--29},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_2},
doi = {10.1007/3-540-45535-3\_2},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/AzarR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/CheriyanV01,
author = {Joseph Cheriyan and
Santosh S. Vempala},
editor = {Karen I. Aardal and
Bert Gerards},
title = {Edge Covers of Setpairs and the Iterative Rounding Method},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {30--44},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_3},
doi = {10.1007/3-540-45535-3\_3},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/CheriyanV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/ChouQS01,
author = {Cheng{-}Feng Mabel Chou and
Maurice Queyranne and
David Simchi{-}Levi},
editor = {Karen I. Aardal and
Bert Gerards},
title = {The Asymptotic Performance Ratio of an On-Line Algorithm for Uniform
Parallel Machine Scheduling with Release Dates},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {45--59},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_4},
doi = {10.1007/3-540-45535-3\_4},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/ChouQS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/ChudakRW01,
author = {Fabi{\'{a}}n A. Chudak and
Tim Roughgarden and
David P. Williamson},
editor = {Karen I. Aardal and
Bert Gerards},
title = {Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method
and Lagrangean Relaxation},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {60--70},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_5},
doi = {10.1007/3-540-45535-3\_5},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/ChudakRW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/CornuejolsL01,
author = {G{\'{e}}rard Cornu{\'{e}}jols and
Yanjun Li},
editor = {Karen I. Aardal and
Bert Gerards},
title = {On the Rank of Mixed 0, 1 Polyhedra},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {71--77},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_6},
doi = {10.1007/3-540-45535-3\_6},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/CornuejolsL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/EisenbrandR01,
author = {Friedrich Eisenbrand and
G{\"{u}}nter Rote},
editor = {Karen I. Aardal and
Bert Gerards},
title = {Fast 2-Variable Integer Programming},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {78--89},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_7},
doi = {10.1007/3-540-45535-3\_7},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/EisenbrandR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/ElkinP01,
author = {Michael Elkin and
David Peleg},
editor = {Karen I. Aardal and
Bert Gerards},
title = {Approximating k-Spanner Problems for k{\textgreater}2},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {90--104},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_8},
doi = {10.1007/3-540-45535-3\_8},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/ElkinP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Fleiner01,
author = {Tam{\'{a}}s Fleiner},
editor = {Karen I. Aardal and
Bert Gerards},
title = {A Matroid Generalization of the Stable Matching Polytope},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {105--114},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_9},
doi = {10.1007/3-540-45535-3\_9},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/Fleiner01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Fleischer01,
author = {Lisa Fleischer},
editor = {Karen I. Aardal and
Bert Gerards},
title = {A 2-Approximation for Minimum Cost \{0, 1, 2\} Vertex Connectivity},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {115--129},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_10},
doi = {10.1007/3-540-45535-3\_10},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/Fleischer01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/FrankK01,
author = {Andr{\'{a}}s Frank and
Tam{\'{a}}s Kir{\'{a}}ly},
editor = {Karen I. Aardal and
Bert Gerards},
title = {Combined Connectivity Augmentation and Orientation Problems},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {130--144},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_11},
doi = {10.1007/3-540-45535-3\_11},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/FrankK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/FrankS01,
author = {Andr{\'{a}}s Frank and
L{\'{a}}szl{\'{o}} Szeg{\"{o}}},
editor = {Karen I. Aardal and
Bert Gerards},
title = {An Extension of a Theorem of Henneberg and Laman},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {145--159},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_12},
doi = {10.1007/3-540-45535-3\_12},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/FrankS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/FujishigeI01,
author = {Satoru Fujishige and
Satoru Iwata},
editor = {Karen I. Aardal and
Bert Gerards},
title = {Bisubmodular Function Minimization},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {160--169},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_13},
doi = {10.1007/3-540-45535-3\_13},
timestamp = {Wed, 16 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/FujishigeI01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/GargKKRSS01,
author = {Naveen Garg and
Rohit Khandekar and
Goran Konjevod and
R. Ravi and
F. Sibel Salman and
Amitabh Sinha II},
editor = {Karen I. Aardal and
Bert Gerards},
title = {On the Integrality Gap of a Natural Formulation of the Single-Sink
Buy-at-Bulk Network Design Problem},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {170--184},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_14},
doi = {10.1007/3-540-45535-3\_14},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/GargKKRSS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Guenin01,
author = {Bertrand Guenin},
editor = {Karen I. Aardal and
Bert Gerards},
title = {Circuit Mengerian Directed Graphs},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {185--195},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_15},
doi = {10.1007/3-540-45535-3\_15},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/Guenin01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Guenin01a,
author = {Bertrand Guenin},
editor = {Karen I. Aardal and
Bert Gerards},
title = {Integral Polyhedra Related to Even Cycle and Even Cut Matroids},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {196--209},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_16},
doi = {10.1007/3-540-45535-3\_16},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/Guenin01a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/HalperinZ01,
author = {Eran Halperin and
Uri Zwick},
editor = {Karen I. Aardal and
Bert Gerards},
title = {A Unified Framework for Obtaining Improved Approximation Algorithms
for Maximum Graph Bisection Problems},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {210--225},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_17},
doi = {10.1007/3-540-45535-3\_17},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/HalperinZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/HassinL01,
author = {Refael Hassin and
Asaf Levin},
editor = {Karen I. Aardal and
Bert Gerards},
title = {Synthesis of 2-Commodity Flow Networks},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {226--235},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_18},
doi = {10.1007/3-540-45535-3\_18},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/HassinL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/HordijkL01,
author = {Arie Hordijk and
D. A. van der Laan},
editor = {Karen I. Aardal and
Bert Gerards},
title = {Bounds for Deterministic Periodic Routing Sequences},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {236--250},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_19},
doi = {10.1007/3-540-45535-3\_19},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/HordijkL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/IyengarC01,
author = {Garud Iyengar and
Mehmet Tolga {\c{C}}ezik},
editor = {Karen I. Aardal and
Bert Gerards},
title = {Cutting Planes for Mixed 0-1 Semidefinite Programs},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {251--263},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_20},
doi = {10.1007/3-540-45535-3\_20},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/IyengarC01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/JacksonJ01,
author = {Bill Jackson and
Tibor Jord{\'{a}}n},
editor = {Karen I. Aardal and
Bert Gerards},
title = {Independence Free Graphs and Vertex Connectivity Augmentation},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {264--279},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_21},
doi = {10.1007/3-540-45535-3\_21},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/JacksonJ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Kodialam01,
author = {Murali S. Kodialam},
editor = {Karen I. Aardal and
Bert Gerards},
title = {The Throughput of Sequential Testing},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {280--292},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_22},
doi = {10.1007/3-540-45535-3\_22},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/Kodialam01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Lasserre01,
author = {Jean B. Lasserre},
editor = {Karen I. Aardal and
Bert Gerards},
title = {An Explicit Exact {SDP} Relaxation for Nonlinear 0-1 Programs},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {293--303},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_23},
doi = {10.1007/3-540-45535-3\_23},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/Lasserre01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Margot01,
author = {Fran{\c{c}}ois Margot},
editor = {Karen I. Aardal and
Bert Gerards},
title = {Pruning by Isomorphism in Branch-and-Cut},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {304--317},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_24},
doi = {10.1007/3-540-45535-3\_24},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/Margot01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/MillerNS01,
author = {Andrew J. Miller and
George L. Nemhauser and
Martin W. P. Savelsbergh},
editor = {Karen I. Aardal and
Bert Gerards},
title = {Facets, Algorithms, and Polyhedral Characterizations for a Multi-item
Production Planning Model with Setup Times},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {318--332},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_25},
doi = {10.1007/3-540-45535-3\_25},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/MillerNS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/NewmanV01,
author = {Alantha Newman and
Santosh S. Vempala},
editor = {Karen I. Aardal and
Bert Gerards},
title = {Fences Are Futile: On Relaxations for the Linear Ordering Problem},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {333--347},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_26},
doi = {10.1007/3-540-45535-3\_26},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/NewmanV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/PerregaardB01,
author = {Michael Perregaard and
Egon Balas},
editor = {Karen I. Aardal and
Bert Gerards},
title = {Generating Cuts from Multiple-Term Disjunctions},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {348--360},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_27},
doi = {10.1007/3-540-45535-3\_27},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/PerregaardB01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/QueyranneS01,
author = {Maurice Queyranne and
Maxim Sviridenko},
editor = {Karen I. Aardal and
Bert Gerards},
title = {A (2+epsilon)-Approximation Algorithm for Generalized Preemptive Open
Shop Problem with Minsum Objective},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {361--369},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_28},
doi = {10.1007/3-540-45535-3\_28},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/QueyranneS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/SchuurmanV01,
author = {Petra Schuurman and
Tjark Vredeveld},
editor = {Karen I. Aardal and
Bert Gerards},
title = {Performance Guarantees of Local Search for Multiprocessor Scheduling},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {370--382},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_29},
doi = {10.1007/3-540-45535-3\_29},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/SchuurmanV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/SeboT01,
author = {Andr{\'{a}}s Seb{\"{o}} and
Eric Tannier},
editor = {Karen I. Aardal and
Bert Gerards},
title = {Connected Joins in Graphs},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {383--395},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_30},
doi = {10.1007/3-540-45535-3\_30},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/SeboT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Sitters01,
author = {Ren{\'{e}} Sitters},
editor = {Karen I. Aardal and
Bert Gerards},
title = {Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated
Parallel Machines},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {396--405},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_31},
doi = {10.1007/3-540-45535-3\_31},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/Sitters01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/SteinW01,
author = {Clifford Stein and
David P. Wagner},
editor = {Karen I. Aardal and
Bert Gerards},
title = {Approximation Algorithms for the Minimum Bends Traveling Salesman
Problem},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {406--422},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_32},
doi = {10.1007/3-540-45535-3\_32},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/SteinW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ipco/2001,
editor = {Karen I. Aardal and
Bert Gerards},
title = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3},
doi = {10.1007/3-540-45535-3},
isbn = {3-540-42225-0},
timestamp = {Tue, 25 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/2001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-04-26 03:03 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
