default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Sergey Sevastyanov
@article{DBLP:journals/scheduling/ChernykhKS24,
author = {Ilya Chernykh and
Alexander V. Kononov and
Sergey Sevastyanov},
title = {An exact solution with an improved running time for the routing flow
shop problem with two machines},
journal = {J. Sched.},
volume = {27},
number = {4},
pages = {329--340},
year = {2024},
url = {https://doi.org/10.1007/s10951-023-00784-8},
doi = {10.1007/S10951-023-00784-8},
timestamp = {Thu, 22 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/ChernykhKS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/motor/ChernykhKS20,
author = {Ilya Chernykh and
Alexander V. Kononov and
Sergey Sevastyanov},
editor = {Alexander V. Kononov and
Michael Yu. Khachay and
Valeriy A. Kalyagin and
Panos M. Pardalos},
title = {A Polynomial-Time Algorithm for the Routing Flow Shop Problem with
Two Machines: An Asymmetric Network with a Fixed Number of Nodes},
booktitle = {Mathematical Optimization Theory and Operations Research - 19th International
Conference, {MOTOR} 2020, Novosibirsk, Russia, July 6-10, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12095},
pages = {301--312},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-49988-4\_21},
doi = {10.1007/978-3-030-49988-4\_21},
timestamp = {Tue, 15 Jun 2021 13:49:14 +0200},
biburl = {https://dblp.org/rec/conf/motor/ChernykhKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-03942,
author = {Ilya Chernykh and
Alexander V. Kononov and
Sergey Sevastyanov},
title = {A polynomial-time algorithm for the routing flow shop problem with
two machines: an asymmetric network with a fixed number of nodes},
journal = {CoRR},
volume = {abs/2004.03942},
year = {2020},
url = {https://arxiv.org/abs/2004.03942},
eprinttype = {arXiv},
eprint = {2004.03942},
timestamp = {Tue, 14 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-03942.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BlocherS15,
author = {James D. Blocher and
Sergey Sevastyanov},
title = {A note on the Coffman-Sethi bound for {LPT} scheduling},
journal = {J. Sched.},
volume = {18},
number = {3},
pages = {325--327},
year = {2015},
url = {https://doi.org/10.1007/s10951-015-0419-z},
doi = {10.1007/S10951-015-0419-Z},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/BlocherS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/SevastyanovCC14,
author = {Sergey Sevastyanov and
D. A. Chemisova and
Ilya Chernykh},
title = {On some properties of optimal schedules in the job shop problem with
preemption and an arbitrary regular criterion},
journal = {Ann. Oper. Res.},
volume = {213},
number = {1},
pages = {253--270},
year = {2014},
url = {https://doi.org/10.1007/s10479-012-1290-3},
doi = {10.1007/S10479-012-1290-3},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/SevastyanovCC14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/ChernykhKS13,
author = {Ilya Chernykh and
Alexander V. Kononov and
Sergey Sevastyanov},
title = {Efficient approximation algorithms for the routing open shop problem},
journal = {Comput. Oper. Res.},
volume = {40},
number = {3},
pages = {841--847},
year = {2013},
url = {https://doi.org/10.1016/j.cor.2012.01.006},
doi = {10.1016/J.COR.2012.01.006},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/ChernykhKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BaptisteCKQSS12,
author = {Philippe Baptiste and
Jacques Carlier and
Alexander V. Kononov and
Maurice Queyranne and
Sergey Sevastyanov and
Maxim Sviridenko},
title = {Integer preemptive scheduling on parallel machines},
journal = {Oper. Res. Lett.},
volume = {40},
number = {6},
pages = {440--444},
year = {2012},
url = {https://doi.org/10.1016/j.orl.2012.06.011},
doi = {10.1016/J.ORL.2012.06.011},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BaptisteCKQSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/KononovSS12,
author = {Alexander V. Kononov and
Sergey Sevastyanov and
Maxim Sviridenko},
title = {A Complete 4-parametric complexity classification of short shop scheduling
problems},
journal = {J. Sched.},
volume = {15},
number = {4},
pages = {427--446},
year = {2012},
url = {https://doi.org/10.1007/s10951-011-0243-z},
doi = {10.1007/S10951-011-0243-Z},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/KononovSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BaptisteCKQSS11,
author = {Philippe Baptiste and
Jacques Carlier and
Alexander V. Kononov and
Maurice Queyranne and
Sergey Sevastyanov and
Maxim Sviridenko},
title = {Properties of optimal schedules in preemptive shop scheduling},
journal = {Discret. Appl. Math.},
volume = {159},
number = {5},
pages = {272--280},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2010.11.015},
doi = {10.1016/J.DAM.2010.11.015},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BaptisteCKQSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SevastyanovLH11,
author = {Sergey Sevastyanov and
Bertrand M. T. Lin and
Hsiao{-}Lan Huang},
title = {Tight complexity analysis of the relocation problem with arbitrary
release dates},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4536--4544},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.034},
doi = {10.1016/J.TCS.2011.04.034},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SevastyanovLH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/SevastyanovL11,
author = {Sergey Sevastyanov and
Bertrand M. T. Lin},
editor = {Ludovica Adacher and
Marta Flamini and
Gianmaria Leo and
Gaia Nicosia and
Andrea Pacifici and
Veronica Piccialli},
title = {Efficient enumeration of optimal and approximate solutions of a scheduling
problem},
booktitle = {Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial
optimization. Extended Abstracts, Villa Mondragone, Frascati, Italy,
June 14-16, 2011},
pages = {248--251},
year = {2011},
url = {http://ctw2011.dia.uniroma3.it/ctw\_proceedings.pdf\#page=260},
timestamp = {Thu, 12 Mar 2020 11:34:41 +0100},
biburl = {https://dblp.org/rec/conf/colognetwente/SevastyanovL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/GoncharovS09,
author = {Yaroslav Goncharov and
Sergey Sevastyanov},
title = {The flow shop problem with no-idle constraints: {A} review and approximation},
journal = {Eur. J. Oper. Res.},
volume = {196},
number = {2},
pages = {450--456},
year = {2009},
url = {https://doi.org/10.1016/j.ejor.2008.03.039},
doi = {10.1016/J.EJOR.2008.03.039},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/GoncharovS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/BaptisteCKQSS09,
author = {Philippe Baptiste and
Jacques Carlier and
Alexander V. Kononov and
Maurice Queyranne and
Sergey Sevastyanov and
Maxim Sviridenko},
editor = {Anna E. Frid and
Andrey Morozov and
Andrey Rybalchenko and
Klaus W. Wagner},
title = {Integrality Property in Preemptive Parallel Machine Scheduling},
booktitle = {Computer Science - Theory and Applications, Fourth International Computer
Science Symposium in Russia, {CSR} 2009, Novosibirsk, Russia, August
18-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5675},
pages = {38--46},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03351-3\_6},
doi = {10.1007/978-3-642-03351-3\_6},
timestamp = {Mon, 01 Mar 2021 13:46:21 +0100},
biburl = {https://dblp.org/rec/conf/csr/BaptisteCKQSS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/KononovSS09,
author = {Alexander V. Kononov and
Sergey Sevastyanov and
Maxim Sviridenko},
editor = {Anna E. Frid and
Andrey Morozov and
Andrey Rybalchenko and
Klaus W. Wagner},
title = {Complete Complexity Classification of Short Shop Scheduling},
booktitle = {Computer Science - Theory and Applications, Fourth International Computer
Science Symposium in Russia, {CSR} 2009, Novosibirsk, Russia, August
18-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5675},
pages = {227--236},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03351-3\_22},
doi = {10.1007/978-3-642-03351-3\_22},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/csr/KononovSS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/ChernykhDKS09,
author = {Ilya Chernykh and
Nikita Dryuck and
Alexander V. Kononov and
Sergey Sevastyanov},
editor = {Evripidis Bampis and
Klaus Jansen},
title = {The Routing Open Shop Problem: New Approximation Algorithms},
booktitle = {Approximation and Online Algorithms, 7th International Workshop, {WAOA}
2009, Copenhagen, Denmark, September 10-11, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5893},
pages = {75--85},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-12450-1\_7},
doi = {10.1007/978-3-642-12450-1\_7},
timestamp = {Thu, 23 Sep 2021 11:48:40 +0200},
biburl = {https://dblp.org/rec/conf/waoa/ChernykhDKS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AgeevFKS06,
author = {Alexander A. Ageev and
Aleksei V. Fishkin and
Alexander V. Kononov and
Sergey V. Sevastianov},
title = {Open block scheduling in optical communication networks},
journal = {Theor. Comput. Sci.},
volume = {361},
number = {2-3},
pages = {257--274},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2006.05.014},
doi = {10.1016/J.TCS.2006.05.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AgeevFKS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/Sevastianov05,
author = {Sergey V. Sevastianov},
title = {An introduction to multi-parameter complexity analysis of discrete
problems},
journal = {Eur. J. Oper. Res.},
volume = {165},
number = {2},
pages = {387--397},
year = {2005},
url = {https://doi.org/10.1016/j.ejor.2004.04.009},
doi = {10.1016/J.EJOR.2004.04.009},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/Sevastianov05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/FishkinJSS05,
author = {Aleksei V. Fishkin and
Klaus Jansen and
Sergey V. Sevastianov and
Ren{\'{e}} Sitters},
editor = {Gerth St{\o}lting Brodal and
Stefano Leonardi},
title = {Preemptive Scheduling of Independent Jobs on Identical Parallel Machines
Subject to Migration Delays},
booktitle = {Algorithms - {ESA} 2005, 13th Annual European Symposium, Palma de
Mallorca, Spain, October 3-6, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3669},
pages = {580--591},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11561071\_52},
doi = {10.1007/11561071\_52},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/esa/FishkinJSS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/or/KoryakinS05,
author = {Roman A. Koryakin and
Sergey V. Sevastianov},
editor = {Hans{-}Dietrich Haasis and
Herbert Kopfer and
J{\"{o}}rn Sch{\"{o}}nberger},
title = {The Flow Shop Problem with Random Operation Processing Times},
booktitle = {Operations Research Proceedings 2005, Selected Papers of the Annual
International Conference of the German Operations Research Society
(GOR), Bremen, Germany, September 7-9, 2005},
pages = {697--702},
year = {2005},
url = {https://doi.org/10.1007/3-540-32539-5\_109},
doi = {10.1007/3-540-32539-5\_109},
timestamp = {Thu, 07 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/or/KoryakinS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/AgeevFKS03,
author = {Alexander A. Ageev and
Aleksei V. Fishkin and
Alexander V. Kononov and
Sergey V. Sevastianov},
editor = {Klaus Jansen and
Roberto Solis{-}Oba},
title = {Open Block Scheduling in Optical Communication Networks},
booktitle = {Approximation and Online Algorithms, First International Workshop,
{WAOA} 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2909},
pages = {13--26},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24592-6\_2},
doi = {10.1007/978-3-540-24592-6\_2},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/AgeevFKS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/or/GimadiS02,
author = {Edward Gimadi and
Sergey V. Sevastianov},
editor = {Ulrike Leopold{-}Wildburger and
Franz Rendl and
Gerhard W{\"{a}}scher},
title = {On Solvability of the Project Scheduling Problem with Accumulative
Resources of an Arbitrary Sign},
booktitle = {Operations Research Proceedings 2002, Selected Papers of the International
Conference on Operations Research {(SOR} 2002), Klagenfurt, Austria,
September 2-5, 2002},
pages = {241--246},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/978-3-642-55537-4\_39},
doi = {10.1007/978-3-642-55537-4\_39},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/or/GimadiS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KashyrskikhPS01,
author = {K. N. Kashyrskikh and
Chris N. Potts and
Sergey V. Sevastianov},
title = {A 3/2-approximation algorithm for two-machine flow-shop sequencing
subject to release dates},
journal = {Discret. Appl. Math.},
volume = {114},
number = {1-3},
pages = {255--271},
year = {2001},
url = {https://doi.org/10.1016/S0166-218X(00)00374-7},
doi = {10.1016/S0166-218X(00)00374-7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KashyrskikhPS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/SevastianovW01,
author = {Sergey V. Sevastianov and
Gerhard J. Woeginger},
title = {Linear time approximation scheme for the multiprocessor open shop
problem},
journal = {Discret. Appl. Math.},
volume = {114},
number = {1-3},
pages = {273--288},
year = {2001},
url = {https://doi.org/10.1016/S0166-218X(00)00375-9},
doi = {10.1016/S0166-218X(00)00375-9},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/SevastianovW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/etfa/GimadiSZ01,
author = {Edward Gimadi and
Sergey V. Sevastianov and
V. V. Zalyubovsky},
title = {On the project scheduling problem under stored resource constraints},
booktitle = {Proceedings of 8th {IEEE} International Conference on Emerging Technologies
and Factory Automation, {ETFA} 2001, October 15-18, 2001, Antibes/Juan
les Pins, France - Volume 2},
pages = {703--705},
publisher = {{IEEE}},
year = {2001},
url = {https://doi.org/10.1109/ETFA.2001.997762},
doi = {10.1109/ETFA.2001.997762},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/etfa/GimadiSZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/KononovST99,
author = {Alexander V. Kononov and
Sergey V. Sevastianov and
I. D. Tchernykh},
title = {When difference in machine loads leadsto efficient scheduling in open
shops},
journal = {Ann. Oper. Res.},
volume = {92},
pages = {211--239},
year = {1999},
url = {https://doi.org/10.1023/A\%3A1018986731638},
doi = {10.1023/A\%3A1018986731638},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/KononovST99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlonACESVW98,
author = {Noga Alon and
Yossi Azar and
J{\'{a}}nos Csirik and
Leah Epstein and
Sergey V. Sevastianov and
Arjen P. A. Vestjens and
Gerhard J. Woeginger},
title = {On-Line and Off-Line Approximation Algorithms for Vector Covering
Problems},
journal = {Algorithmica},
volume = {21},
number = {1},
pages = {104--118},
year = {1998},
url = {https://doi.org/10.1007/PL00009203},
doi = {10.1007/PL00009203},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlonACESVW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/Sevastianov98,
author = {Sergey V. Sevastianov},
title = {Nonstrict vector summationin multi-operation scheduling},
journal = {Ann. Oper. Res.},
volume = {83},
pages = {179--212},
year = {1998},
url = {https://doi.org/10.1023/A\%3A1018908013582},
doi = {10.1023/A\%3A1018908013582},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/Sevastianov98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/SevastianovW98,
author = {Sergey V. Sevastianov and
Gerhard J. Woeginger},
title = {Makespan Minimization in Preemptive Two Machine Job Shops},
journal = {Computing},
volume = {60},
number = {1},
pages = {73--80},
year = {1998},
url = {https://doi.org/10.1007/BF02684330},
doi = {10.1007/BF02684330},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/SevastianovW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/SevastianovW98,
author = {Sergey V. Sevastianov and
Gerhard J. Woeginger},
title = {Makespan minimization in open shops: {A} polynomial time approximation
scheme},
journal = {Math. Program.},
volume = {82},
pages = {191--198},
year = {1998},
url = {https://doi.org/10.1007/BF01585871},
doi = {10.1007/BF01585871},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/SevastianovW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/SevastianovT98,
author = {Sergey V. Sevastianov and
I. D. Tchernykh},
editor = {Gianfranco Bilardi and
Giuseppe F. Italiano and
Andrea Pietracaprina and
Geppino Pucci},
title = {Computer-Aided Way to Prove Theorems in Scheduling},
booktitle = {Algorithms - {ESA} '98, 6th Annual European Symposium, Venice, Italy,
August 24-26, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1461},
pages = {502--513},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-68530-8\_42},
doi = {10.1007/3-540-68530-8\_42},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/SevastianovT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/SevastjanovB97,
author = {Sergey Vasil'evich Sevast'janov and
Wojciech Banaszczyk},
title = {To the Steinitz lemma in coordinate form},
journal = {Discret. Math.},
volume = {169},
number = {1-3},
pages = {145--152},
year = {1997},
url = {https://doi.org/10.1016/0012-365X(94)00240-J},
doi = {10.1016/0012-365X(94)00240-J},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/SevastjanovB97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/WilliamsonHHHLS97,
author = {David P. Williamson and
Leslie A. Hall and
J. A. Hoogeveen and
Cor A. J. Hurkens and
Jan Karel Lenstra and
Sergey Vasil'evich Sevast'janov and
David B. Shmoys},
title = {Short Shop Schedules},
journal = {Oper. Res.},
volume = {45},
number = {2},
pages = {288--294},
year = {1997},
url = {https://doi.org/10.1287/opre.45.2.288},
doi = {10.1287/OPRE.45.2.288},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/WilliamsonHHHLS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Sevastianov97,
author = {Sergey V. Sevastianov},
editor = {Rainer E. Burkard and
Gerhard J. Woeginger},
title = {Seven Problems: So Different yet Close},
booktitle = {Algorithms - {ESA} '97, 5th Annual European Symposium, Graz, Austria,
September 15-17, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1284},
pages = {443--458},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63397-9\_34},
doi = {10.1007/3-540-63397-9\_34},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/Sevastianov97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AlonCSVW96,
author = {Noga Alon and
J{\'{a}}nos Csirik and
Sergey V. Sevastianov and
Arjen P. A. Vestjens and
Gerhard J. Woeginger},
editor = {Josep D{\'{\i}}az and
Maria J. Serna},
title = {On-line and Off-line Approximation Algorithms for Vector Covering
Problems},
booktitle = {Algorithms - {ESA} '96, Fourth Annual European Symposium, Barcelona,
Spain, September 25-27, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1136},
pages = {406--418},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61680-2\_71},
doi = {10.1007/3-540-61680-2\_71},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/AlonCSVW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/Sevastjanov95,
author = {Sergey Vasil'evich Sevast'janov},
title = {Vector Summation in Banach Space and Polynomial Algorithms for Flow
Shops and Open Shops},
journal = {Math. Oper. Res.},
volume = {20},
number = {1},
pages = {90--103},
year = {1995},
url = {https://doi.org/10.1287/moor.20.1.90},
doi = {10.1287/MOOR.20.1.90},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/Sevastjanov95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Sevastjanov94,
author = {Sergey Vasil'evich Sevast'janov},
title = {on Some Geometric Methods in Scheduling Theory: {A} Survey},
journal = {Discret. Appl. Math.},
volume = {55},
number = {1},
pages = {59--82},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90036-1},
doi = {10.1016/0166-218X(94)90036-1},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Sevastjanov94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/AvgustinovichS92,
author = {Sergey V. Avgustinovich and
Sergey Vasil'evich Sevast'janov},
title = {Vector Summation within Minimal Angle},
journal = {Comput. Geom.},
volume = {2},
pages = {235--239},
year = {1992},
url = {https://doi.org/10.1016/0925-7721(93)90020-7},
doi = {10.1016/0925-7721(93)90020-7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/AvgustinovichS92.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.
last updated on 2024-08-23 19:27 CEST 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:
