Search dblp for Publications

export results for "toc:db/journals/disopt/disopt7.bht:"

 download as .bib file

@article{DBLP:journals/disopt/AissiBV10,
  author       = {Hassene Aissi and
                  Cristina Bazgan and
                  Daniel Vanderpooten},
  title        = {General approximation schemes for min-max (regret) versions of some
                  (pseudo-)polynomial problems},
  journal      = {Discret. Optim.},
  volume       = {7},
  number       = {3},
  pages        = {136--148},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disopt.2010.03.004},
  doi          = {10.1016/J.DISOPT.2010.03.004},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/AissiBV10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/Averbakh10,
  author       = {Igor Averbakh},
  title        = {Minmax regret bottleneck problems with solution-induced interval uncertainty
                  structure},
  journal      = {Discret. Optim.},
  volume       = {7},
  number       = {3},
  pages        = {181--190},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disopt.2010.03.007},
  doi          = {10.1016/J.DISOPT.2010.03.007},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/Averbakh10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/BendaliDMM10,
  author       = {Fatiha Bendali and
                  I. Diarrassouba and
                  Ali Ridha Mahjoub and
                  Jean Mailfert},
  title        = {The k edge-disjoint 3-hop-constrained paths polytope},
  journal      = {Discret. Optim.},
  volume       = {7},
  number       = {4},
  pages        = {222--233},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disopt.2010.05.001},
  doi          = {10.1016/J.DISOPT.2010.05.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/BendaliDMM10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/BiroF10,
  author       = {P{\'{e}}ter Bir{\'{o}} and
                  Tam{\'{a}}s Fleiner},
  title        = {The integral stable allocation problem on graphs},
  journal      = {Discret. Optim.},
  volume       = {7},
  number       = {1-2},
  pages        = {64--73},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disopt.2010.02.002},
  doi          = {10.1016/J.DISOPT.2010.02.002},
  timestamp    = {Fri, 09 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/BiroF10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/CapraraLM10,
  author       = {Alberto Caprara and
                  Andrea Lodi and
                  Michele Monaci},
  title        = {An approximation scheme for the two-stage, two-dimensional knapsack
                  problem},
  journal      = {Discret. Optim.},
  volume       = {7},
  number       = {3},
  pages        = {114--124},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disopt.2010.03.003},
  doi          = {10.1016/J.DISOPT.2010.03.003},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/CapraraLM10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/CouetouxGMT10,
  author       = {Basile Cou{\"{e}}toux and
                  Laurent Gourv{\`{e}}s and
                  J{\'{e}}r{\^{o}}me Monnot and
                  Orestis Telelis},
  title        = {Labeled Traveling Salesman Problems: Complexity and approximation},
  journal      = {Discret. Optim.},
  volume       = {7},
  number       = {1-2},
  pages        = {74--85},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disopt.2010.02.003},
  doi          = {10.1016/J.DISOPT.2010.02.003},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/CouetouxGMT10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/DeinekoW10,
  author       = {Vladimir G. Deineko and
                  Gerhard J. Woeginger},
  title        = {Pinpointing the complexity of the interval min-max regret knapsack
                  problem},
  journal      = {Discret. Optim.},
  volume       = {7},
  number       = {4},
  pages        = {191--196},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disopt.2010.03.008},
  doi          = {10.1016/J.DISOPT.2010.03.008},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/DeinekoW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/DeyW10,
  author       = {Santanu S. Dey and
                  Laurence A. Wolsey},
  title        = {Composite lifting of group inequalities and an application to two-row
                  mixing inequalities},
  journal      = {Discret. Optim.},
  volume       = {7},
  number       = {4},
  pages        = {256--268},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disopt.2010.06.001},
  doi          = {10.1016/J.DISOPT.2010.06.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/DeyW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/DosaT10,
  author       = {Gy{\"{o}}rgy D{\'{o}}sa and
                  Zhiyi Tan},
  title        = {New upper and lower bounds for online scheduling with machine cost},
  journal      = {Discret. Optim.},
  volume       = {7},
  number       = {3},
  pages        = {125--135},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disopt.2010.02.005},
  doi          = {10.1016/J.DISOPT.2010.02.005},
  timestamp    = {Mon, 16 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/DosaT10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/EmelichevP10,
  author       = {Vladimir A. Emelichev and
                  Dmitry Podkopaev},
  title        = {Quantitative stability analysis for vector problems of 0-1 programming},
  journal      = {Discret. Optim.},
  volume       = {7},
  number       = {1-2},
  pages        = {48--63},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disopt.2010.02.001},
  doi          = {10.1016/J.DISOPT.2010.02.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/EmelichevP10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/FukunagaN10,
  author       = {Takuro Fukunaga and
                  Hiroshi Nagamochi},
  title        = {Network design with weighted degree constraints},
  journal      = {Discret. Optim.},
  volume       = {7},
  number       = {4},
  pages        = {246--255},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disopt.2010.05.004},
  doi          = {10.1016/J.DISOPT.2010.05.004},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/FukunagaN10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/GrigoriuF10,
  author       = {Liliana Grigoriu and
                  Donald K. Friesen},
  title        = {Scheduling on same-speed processors with at most one downtime on each
                  machine},
  journal      = {Discret. Optim.},
  volume       = {7},
  number       = {4},
  pages        = {212--221},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disopt.2010.04.003},
  doi          = {10.1016/J.DISOPT.2010.04.003},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/GrigoriuF10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/HaouariLS10,
  author       = {Mohamed Haouari and
                  Safa Bhar Layeb and
                  Hanif D. Sherali},
  title        = {Algorithmic expedients for the Prize Collecting Steiner Tree Problem},
  journal      = {Discret. Optim.},
  volume       = {7},
  number       = {1-2},
  pages        = {32--47},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disopt.2010.01.001},
  doi          = {10.1016/J.DISOPT.2010.01.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/HaouariLS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/HeilpornCL10,
  author       = {G{\'{e}}raldine Heilporn and
                  Jean{-}Fran{\c{c}}ois Cordeau and
                  Gilbert Laporte},
  title        = {The Delivery Man Problem with time windows},
  journal      = {Discret. Optim.},
  volume       = {7},
  number       = {4},
  pages        = {269--282},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disopt.2010.06.002},
  doi          = {10.1016/J.DISOPT.2010.06.002},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/disopt/HeilpornCL10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/Kobayashi10,
  author       = {Yusuke Kobayashi},
  title        = {A simple algorithm for finding a maximum triangle-free 2-matching
                  in subcubic graphs},
  journal      = {Discret. Optim.},
  volume       = {7},
  number       = {4},
  pages        = {197--202},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disopt.2010.04.001},
  doi          = {10.1016/J.DISOPT.2010.04.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/Kobayashi10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/KobayashiS10,
  author       = {Yusuke Kobayashi and
                  Christian Sommer},
  title        = {On shortest disjoint paths in planar graphs},
  journal      = {Discret. Optim.},
  volume       = {7},
  number       = {4},
  pages        = {234--245},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disopt.2010.05.002},
  doi          = {10.1016/J.DISOPT.2010.05.002},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/KobayashiS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/MarchettiK10,
  author       = {Olivier Marchetti and
                  Alix Munier Kordon},
  title        = {Complexity results for Weighted Timed Event Graphs},
  journal      = {Discret. Optim.},
  volume       = {7},
  number       = {3},
  pages        = {166--180},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disopt.2010.03.006},
  doi          = {10.1016/J.DISOPT.2010.03.006},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/MarchettiK10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/PrzybylskiGE10,
  author       = {Anthony Przybylski and
                  Xavier Gandibleux and
                  Matthias Ehrgott},
  title        = {A two phase method for multi-objective integer programming and its
                  application to the assignment problem with three objectives},
  journal      = {Discret. Optim.},
  volume       = {7},
  number       = {3},
  pages        = {149--165},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disopt.2010.03.005},
  doi          = {10.1016/J.DISOPT.2010.03.005},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/disopt/PrzybylskiGE10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/PrzykuckiS10,
  author       = {Michal Przykucki and
                  Malgorzata Sulkowska},
  title        = {Gusein-Zade problem for directed path},
  journal      = {Discret. Optim.},
  volume       = {7},
  number       = {1-2},
  pages        = {13--20},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disopt.2009.08.001},
  doi          = {10.1016/J.DISOPT.2009.08.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/PrzykuckiS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/Qiao10,
  author       = {Shengning Qiao},
  title        = {On zeroth-order general Randic index of quasi-tree graphs containing
                  cycles},
  journal      = {Discret. Optim.},
  volume       = {7},
  number       = {3},
  pages        = {93--98},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disopt.2010.03.001},
  doi          = {10.1016/J.DISOPT.2010.03.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/Qiao10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/ReineltW10,
  author       = {Gerhard Reinelt and
                  Klaus Michael Wenger},
  title        = {Generating partitions of a graph into a fixed number of minimum weight
                  cuts},
  journal      = {Discret. Optim.},
  volume       = {7},
  number       = {1-2},
  pages        = {1--12},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disopt.2009.07.001},
  doi          = {10.1016/J.DISOPT.2009.07.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/ReineltW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/ShiuCC10,
  author       = {Wai Chee Shiu and
                  Xue{-}Gang Chen and
                  Wai Hong Chan},
  title        = {Triangle-free graphs with large independent domination number},
  journal      = {Discret. Optim.},
  volume       = {7},
  number       = {1-2},
  pages        = {86--92},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disopt.2010.02.004},
  doi          = {10.1016/J.DISOPT.2010.02.004},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/ShiuCC10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/SilvaU10,
  author       = {Rodrigo Ferreira da Silva and
                  Sebasti{\'{a}}n Urrutia},
  title        = {A General {VNS} heuristic for the traveling salesman problem with
                  time windows},
  journal      = {Discret. Optim.},
  volume       = {7},
  number       = {4},
  pages        = {203--211},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disopt.2010.04.002},
  doi          = {10.1016/J.DISOPT.2010.04.002},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/SilvaU10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/Stephan10,
  author       = {R{\"{u}}diger Stephan},
  title        = {Cardinality constrained combinatorial optimization: Complexity and
                  polyhedra},
  journal      = {Discret. Optim.},
  volume       = {7},
  number       = {3},
  pages        = {99--113},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disopt.2010.03.002},
  doi          = {10.1016/J.DISOPT.2010.03.002},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/Stephan10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/ThomasW10,
  author       = {Doreen A. Thomas and
                  Jia F. Weng},
  title        = {Computing Steiner points for gradient-constrained minimum networks},
  journal      = {Discret. Optim.},
  volume       = {7},
  number       = {1-2},
  pages        = {21--31},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disopt.2009.10.001},
  doi          = {10.1016/J.DISOPT.2009.10.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/ThomasW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.