default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/disopt/disopt8.bht:"
download as .bib file
@article{DBLP:journals/disopt/Abu-KhzamFLLS11,
author = {Faisal N. Abu{-}Khzam and
Henning Fernau and
Michael A. Langston and
Serena Lee{-}Cultura and
Ulrike Stege},
title = {Charge and reduce: {A} fixed-parameter algorithm for String-to-String
Correction},
journal = {Discret. Optim.},
volume = {8},
number = {1},
pages = {41--49},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.10.003},
doi = {10.1016/J.DISOPT.2010.10.003},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/Abu-KhzamFLLS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/AloisioAM11,
author = {Alessandro Aloisio and
Claudio Arbib and
Fabrizio Marinelli},
title = {Cutting stock with no three parts per pattern: Work-in-process and
pattern minimization},
journal = {Discret. Optim.},
volume = {8},
number = {2},
pages = {315--332},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.10.002},
doi = {10.1016/J.DISOPT.2010.10.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/AloisioAM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/AltinakarCH11,
author = {Sivan Altinakar and
Gilles Caporossi and
Alain Hertz},
title = {On compact k-edge-colorings: {A} polynomial time reduction from linear
to cyclic},
journal = {Discret. Optim.},
volume = {8},
number = {3},
pages = {502--512},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2011.04.004},
doi = {10.1016/J.DISOPT.2011.04.004},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/AltinakarCH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/BaiouB11,
author = {Mourad Ba{\"{\i}}ou and
Francisco Barahona},
title = {On the linear relaxation of the p-median problem},
journal = {Discret. Optim.},
volume = {8},
number = {2},
pages = {344--375},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.12.002},
doi = {10.1016/J.DISOPT.2010.12.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/BaiouB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/Ben-ZwiHLN11,
author = {Oren Ben{-}Zwi and
Danny Hermelin and
Daniel Lokshtanov and
Ilan Newman},
title = {Treewidth governs the complexity of target set selection},
journal = {Discret. Optim.},
volume = {8},
number = {1},
pages = {87--96},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.09.007},
doi = {10.1016/J.DISOPT.2010.09.007},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/Ben-ZwiHLN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/BoydC11,
author = {Sylvia C. Boyd and
Robert Carr},
title = {Finding low cost {TSP} and 2-matching solutions using certain half-integer
subtour vertices},
journal = {Discret. Optim.},
volume = {8},
number = {4},
pages = {525--539},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2011.05.002},
doi = {10.1016/J.DISOPT.2011.05.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/BoydC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/BrotcorneCMS11,
author = {Luce Brotcorne and
F. Cirinei and
Patrice Marcotte and
Gilles Savard},
title = {An exact algorithm for the network pricing problem},
journal = {Discret. Optim.},
volume = {8},
number = {2},
pages = {246--258},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.09.003},
doi = {10.1016/J.DISOPT.2010.09.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/BrotcorneCMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/CaroH11,
author = {Yair Caro and
Michael A. Henning},
title = {A Greedy Partition Lemma for directed domination},
journal = {Discret. Optim.},
volume = {8},
number = {3},
pages = {452--458},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2011.03.003},
doi = {10.1016/J.DISOPT.2011.03.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/CaroH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/CelaSWW11,
author = {Eranda {\c{C}}ela and
Nina S. Schmuck and
Shmuel Wimer and
Gerhard J. Woeginger},
title = {The Wiener maximum quadratic assignment problem},
journal = {Discret. Optim.},
volume = {8},
number = {3},
pages = {411--416},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2011.02.002},
doi = {10.1016/J.DISOPT.2011.02.002},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/CelaSWW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/Damaschke11,
author = {Peter Damaschke},
title = {Parameterized algorithms for double hypergraph dualization with rank
limitation and maximum minimal vertex cover},
journal = {Discret. Optim.},
volume = {8},
number = {1},
pages = {18--24},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.02.006},
doi = {10.1016/J.DISOPT.2010.02.006},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/Damaschke11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/DonneM11,
author = {Diego Delle Donne and
Javier Marenco},
title = {A branch-and-cut algorithm for the minimum-adjacency vertex coloring
problem},
journal = {Discret. Optim.},
volume = {8},
number = {4},
pages = {540--554},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2011.05.003},
doi = {10.1016/J.DISOPT.2011.05.003},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/DonneM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/DumitrescuJT11,
author = {Adrian Dumitrescu and
Minghui Jiang and
Csaba D. T{\'{o}}th},
title = {New bounds on the average distance from the Fermat-Weber center of
a planar convex body},
journal = {Discret. Optim.},
volume = {8},
number = {3},
pages = {417--427},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2011.02.004},
doi = {10.1016/J.DISOPT.2011.02.004},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/DumitrescuJT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/EpsteinFL11,
author = {Leah Epstein and
Lene M. Favrholdt and
Asaf Levin},
title = {Online variable-sized bin packing with conflicts},
journal = {Discret. Optim.},
volume = {8},
number = {2},
pages = {333--343},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.11.001},
doi = {10.1016/J.DISOPT.2010.11.001},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/EpsteinFL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/ErdoganT11,
author = {G{\"{u}}nes Erdogan and
Barbaros {\c{C}}. Tansel},
title = {Two classes of Quadratic Assignment Problems that are solvable as
Linear Assignment Problems},
journal = {Discret. Optim.},
volume = {8},
number = {3},
pages = {446--451},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2011.03.002},
doi = {10.1016/J.DISOPT.2011.03.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/ErdoganT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/FellowsFG11,
author = {Michael R. Fellows and
Fedor V. Fomin and
Gregory Z. Gutin},
title = {Special Issue on Parameterized Complexity of Discrete Optimization},
journal = {Discret. Optim.},
volume = {8},
number = {1},
pages = {1},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2011.02.001},
doi = {10.1016/J.DISOPT.2011.02.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/FellowsFG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/FellowsGKNU11,
author = {Michael R. Fellows and
Jiong Guo and
Christian Komusiewicz and
Rolf Niedermeier and
Johannes Uhlmann},
title = {Graph-based data clustering with overlaps},
journal = {Discret. Optim.},
volume = {8},
number = {1},
pages = {2--17},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.09.006},
doi = {10.1016/J.DISOPT.2010.09.006},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/FellowsGKNU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/FukasawaG11,
author = {Ricardo Fukasawa and
Oktay G{\"{u}}nl{\"{u}}k},
title = {Strengthening lattice-free cuts using non-negativity},
journal = {Discret. Optim.},
volume = {8},
number = {2},
pages = {229--245},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.09.002},
doi = {10.1016/J.DISOPT.2010.09.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/FukasawaG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/GadeK11,
author = {Dinakar Gade and
Simge K{\"{u}}{\c{c}}{\"{u}}kyavuz},
title = {A Note on "Lot-sizing with fixed charges on stocks: The convex hull"},
journal = {Discret. Optim.},
volume = {8},
number = {2},
pages = {385--392},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2011.02.003},
doi = {10.1016/J.DISOPT.2011.02.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/GadeK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/GilpinS11,
author = {Andrew Gilpin and
Tuomas Sandholm},
title = {Information-theoretic approaches to branching in search},
journal = {Discret. Optim.},
volume = {8},
number = {2},
pages = {147--159},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.07.001},
doi = {10.1016/J.DISOPT.2010.07.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/GilpinS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/GolovachT11,
author = {Petr A. Golovach and
Dimitrios M. Thilikos},
title = {Paths of bounded length and their cuts: Parameterized complexity and
algorithms},
journal = {Discret. Optim.},
volume = {8},
number = {1},
pages = {72--86},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.09.009},
doi = {10.1016/J.DISOPT.2010.09.009},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/GolovachT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/Guillemot11,
author = {Sylvain Guillemot},
title = {Parameterized complexity and approximability of the Longest Compatible
Sequence problem},
journal = {Discret. Optim.},
volume = {8},
number = {1},
pages = {50--60},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.08.003},
doi = {10.1016/J.DISOPT.2010.08.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/Guillemot11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/Guillemot11a,
author = {Sylvain Guillemot},
title = {{FPT} algorithms for path-transversal and cycle-transversal problems},
journal = {Discret. Optim.},
volume = {8},
number = {1},
pages = {61--71},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.05.003},
doi = {10.1016/J.DISOPT.2010.05.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/Guillemot11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/Guttmann-BeckH11,
author = {Nili Guttmann{-}Beck and
Refael Hassin},
title = {On coloring the arcs of a tournament, covering shortest paths, and
reducing the diameter of a graph},
journal = {Discret. Optim.},
volume = {8},
number = {2},
pages = {302--314},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.09.008},
doi = {10.1016/J.DISOPT.2010.09.008},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/Guttmann-BeckH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/HaynesHY11,
author = {Teresa W. Haynes and
Michael A. Henning and
Anders Yeo},
title = {A proof of a conjecture on diameter 2-critical graphs whose complements
are claw-free},
journal = {Discret. Optim.},
volume = {8},
number = {3},
pages = {495--501},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2011.04.003},
doi = {10.1016/J.DISOPT.2011.04.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/HaynesHY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/HeilpornLMS11,
author = {G{\'{e}}raldine Heilporn and
Martine Labb{\'{e}} and
Patrice Marcotte and
Gilles Savard},
title = {Valid inequalities and branch-and-cut for the clique pricing problem},
journal = {Discret. Optim.},
volume = {8},
number = {3},
pages = {393--410},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2011.01.001},
doi = {10.1016/J.DISOPT.2011.01.001},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/HeilpornLMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/HiraiK11,
author = {Hiroshi Hirai and
Shungo Koichi},
title = {On duality and fractionality of multicommodity flows in directed networks},
journal = {Discret. Optim.},
volume = {8},
number = {3},
pages = {428--445},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2011.03.001},
doi = {10.1016/J.DISOPT.2011.03.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/HiraiK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/JanuschowskiP11,
author = {Tim Januschowski and
Marc E. Pfetsch},
title = {The maximum k-colorable subgraph problem and orbitopes},
journal = {Discret. Optim.},
volume = {8},
number = {3},
pages = {478--494},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2011.04.002},
doi = {10.1016/J.DISOPT.2011.04.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/JanuschowskiP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/KaibelPP11,
author = {Volker Kaibel and
Matthias Peinhardt and
Marc E. Pfetsch},
title = {Orbitopal fixing},
journal = {Discret. Optim.},
volume = {8},
number = {4},
pages = {595--610},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2011.07.001},
doi = {10.1016/J.DISOPT.2011.07.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/KaibelPP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/KneisLR11,
author = {Joachim Kneis and
Alexander Langer and
Peter Rossmanith},
title = {Courcelle's theorem - {A} game-theoretic approach},
journal = {Discret. Optim.},
volume = {8},
number = {4},
pages = {568--594},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2011.06.001},
doi = {10.1016/J.DISOPT.2011.06.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/KneisLR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/Kuivinen11,
author = {Fredrik Kuivinen},
title = {On the complexity of submodular function minimisation on diamonds},
journal = {Discret. Optim.},
volume = {8},
number = {3},
pages = {459--477},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2011.04.001},
doi = {10.1016/J.DISOPT.2011.04.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/Kuivinen11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/LampisKM11,
author = {Michael Lampis and
Georgia Kaouri and
Valia Mitsou},
title = {On the algorithmic effectiveness of digraph decompositions and complexity
measures},
journal = {Discret. Optim.},
volume = {8},
number = {1},
pages = {129--138},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.03.010},
doi = {10.1016/J.DISOPT.2010.03.010},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/LampisKM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/LeeLP11,
author = {Kangbok Lee and
Joseph Y.{-}T. Leung and
Michael L. Pinedo},
title = {Coordination mechanisms with hybrid local policies},
journal = {Discret. Optim.},
volume = {8},
number = {4},
pages = {513--524},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2011.05.001},
doi = {10.1016/J.DISOPT.2011.05.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/LeeLP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/LokshtanovRSS11,
author = {Daniel Lokshtanov and
Venkatesh Raman and
Saket Saurabh and
Somnath Sikdar},
title = {On the directed Full Degree Spanning Tree problem},
journal = {Discret. Optim.},
volume = {8},
number = {1},
pages = {97--109},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.09.001},
doi = {10.1016/J.DISOPT.2010.09.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/LokshtanovRSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/MalagutiMT11,
author = {Enrico Malaguti and
Michele Monaci and
Paolo Toth},
title = {An exact approach for the Vertex Coloring Problem},
journal = {Discret. Optim.},
volume = {8},
number = {2},
pages = {174--190},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.07.005},
doi = {10.1016/J.DISOPT.2010.07.005},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/MalagutiMT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/MarxS11,
author = {D{\'{a}}niel Marx and
Ildik{\'{o}} Schlotter},
title = {Stable assignment with couples: Parameterized complexity and local
search},
journal = {Discret. Optim.},
volume = {8},
number = {1},
pages = {25--40},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.07.004},
doi = {10.1016/J.DISOPT.2010.07.004},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/MarxS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/MisraRS11,
author = {Neeldhara Misra and
Venkatesh Raman and
Saket Saurabh},
title = {Lower bounds on kernelization},
journal = {Discret. Optim.},
volume = {8},
number = {1},
pages = {110--128},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.10.001},
doi = {10.1016/J.DISOPT.2010.10.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/MisraRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/NikolaevJ11,
author = {Alexander G. Nikolaev and
Sheldon H. Jacobson},
title = {Using Markov chains to analyze the effectiveness of local search algorithms},
journal = {Discret. Optim.},
volume = {8},
number = {2},
pages = {160--173},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.07.002},
doi = {10.1016/J.DISOPT.2010.07.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/NikolaevJ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/PostaFM11,
author = {Marius Posta and
Jacques A. Ferland and
Philippe Michelon},
title = {Generalized resolution search},
journal = {Discret. Optim.},
volume = {8},
number = {2},
pages = {215--228},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.08.004},
doi = {10.1016/J.DISOPT.2010.08.004},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/PostaFM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/RawitzS11,
author = {Dror Rawitz and
Shimon Shahar},
title = {Partial multicovering and the d-consecutive ones property},
journal = {Discret. Optim.},
volume = {8},
number = {4},
pages = {555--567},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2011.05.004},
doi = {10.1016/J.DISOPT.2011.05.004},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/RawitzS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/Szabo11,
author = {J{\'{a}}cint Szab{\'{o}}},
title = {Upgrading edge-disjoint paths in a ring},
journal = {Discret. Optim.},
volume = {8},
number = {2},
pages = {206--214},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.08.002},
doi = {10.1016/J.DISOPT.2010.08.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/Szabo11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/Szeider11,
author = {Stefan Szeider},
title = {The parameterized complexity of k-flip local search for {SAT} and
{MAX} {SAT}},
journal = {Discret. Optim.},
volume = {8},
number = {1},
pages = {139--145},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.07.003},
doi = {10.1016/J.DISOPT.2010.07.003},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/Szeider11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/TitiloyeC11,
author = {Olawale Titiloye and
Alan Crispin},
title = {Quantum annealing of the graph coloring problem},
journal = {Discret. Optim.},
volume = {8},
number = {2},
pages = {376--384},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.12.001},
doi = {10.1016/J.DISOPT.2010.12.001},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/TitiloyeC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/ZengR11,
author = {Bo Zeng and
Jean{-}Philippe P. Richard},
title = {A polyhedral study on 0-1 knapsack problems with disjoint cardinality
constraints: Strong valid inequalities by sequence-independent lifting},
journal = {Discret. Optim.},
volume = {8},
number = {2},
pages = {259--276},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.09.004},
doi = {10.1016/J.DISOPT.2010.09.004},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/ZengR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/ZengR11a,
author = {Bo Zeng and
Jean{-}Philippe P. Richard},
title = {A polyhedral study on 0-1 knapsack problems with disjoint cardinality
constraints: Facet-defining inequalities by sequential lifting},
journal = {Discret. Optim.},
volume = {8},
number = {2},
pages = {277--301},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.09.005},
doi = {10.1016/J.DISOPT.2010.09.005},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/ZengR11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/ZhangKP11,
author = {Ruonan Zhang and
Santosh N. Kabadi and
Abraham P. Punnen},
title = {The minimum spanning tree problem with conflict constraints and its
variations},
journal = {Discret. Optim.},
volume = {8},
number = {2},
pages = {191--205},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.08.001},
doi = {10.1016/J.DISOPT.2010.08.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/ZhangKP11.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.
retrieved on 2024-09-21 07:33 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:
