• A
  • A
  • A
  • АБВ
  • АБВ
  • АБВ
  • A
  • A
  • A
  • A
  • A
Обычная версия сайта
  • RU
  • EN
  • HSE University
  • Publications
  • Articles
  • A partial evaluation approach for the School Bus Routing Problem
  • RU
  • EN
Расширенный поиск
Высшая школа экономики
Национальный исследовательский университет
Priority areas
  • business informatics
  • economics
  • engineering science
  • humanitarian
  • IT and mathematics
  • law
  • management
  • mathematics
  • sociology
  • state and public administration
by year
  • 2028
  • 2027
  • 2026
  • 2025
  • 2024
  • 2023
  • 2022
  • 2021
  • 2020
  • 2019
  • 2018
  • 2017
  • 2016
  • 2015
  • 2014
  • 2013
  • 2012
  • 2011
  • 2010
  • 2009
  • 2008
  • 2007
  • 2006
  • 2005
  • 2004
  • 2003
  • 2002
  • 2001
  • 2000
  • 1999
  • 1998
  • 1997
  • 1996
  • 1995
  • 1994
  • 1993
  • 1992
  • 1991
  • 1990
  • 1989
  • 1988
  • 1987
  • 1986
  • 1985
  • 1984
  • 1983
  • 1982
  • 1981
  • 1980
  • 1979
  • 1978
  • 1977
  • 1976
  • 1975
  • 1974
  • 1973
  • 1972
  • 1971
  • 1970
  • 1969
  • 1968
  • 1967
  • 1966
  • 1965
  • 1964
  • 1963
  • 1958
  • More
Subject
News
September 25, 2026
AI Users Earn Up to 41.8% More Than Non-Users
Research conducted by economists at HSE University has revealed a significant correlation between the regular use of GenAI in the workplace and higher pay among Russian employees. The study found that individuals who frequently use GenAI in their professional activities earn notably more than those who reject these new tools or resort to them occasionally. The salary premium for highly qualified specialists reaches 41.8%. The article was published in the Voprosy Ekonomiki journal.
September 24, 2026
‘Feedback and Constructive Criticism Are Essential in Our Profession
Vincent Fardeau, Associate Professor at HSE ICEF, has reached a major career milestone: he recently published his paper ‘Asymmetric Thin Markets’ in the Journal of Financial Economics, successfully passed his major academic review, and received tenure. In this interview, Vincent discusses the story behind the paper, explains the concept of asymmetric thin markets, and shares his advice for young scholars aiming to publish in top-tier journals.
September 22, 2026
Personal Interest in Doctoral Thesis Topic Most Important for Confidence in Successful Defence
A researcher at HSE University analysed data on 1,539 doctoral students from 161 Russian universities to identify which features of a thesis topic are associated with academic success and engagement. The most important factor was found to be personal interest in the research topic, which was associated with almost all key aspects of doctoral programme experience—from engaging with the academic supervisor to research activity and confidence about successfully defending the thesis. The findings have been published in Higher Education.

 

Have you spotted a typo?
Highlight it, click Ctrl+Enter and send us a message. Thank you for your help!

Publications
  • Books
  • Articles
  • Chapters of books
  • Working papers
  • Report a publication
  • Research at HSE

?

A partial evaluation approach for the School Bus Routing Problem

Heliyon. 2022. Vol. 8. No. 4. Article e09291.
Pérez A. C., Sánchez-Ansola E., Rosete A., Rojas O., Sosa Gómez G.
Language: English
DOI
Keywords: combinatorial optimizationschool bus routing problempartial evaluation
Similar publications
Conscious Exploration of Alpha-Cuts in the Parametric Solution of the School Bus Routing Problem with Fuzzy Walking Distance
Sánchez-Ansola E., Pérez-Pérez A., Rosete A. et al., Computational Intelligence and Neuroscience 2022 Vol. 2022 P. 1–9
Added: September 18, 2026
Handbook of Combinatorial Optimization
Springer, 2025.
The second edition of this 5-volume handbook is intended to be a basic yet comprehensive reference work in combinatorial optimization that will benefit newcomers and researchers for years to come. This multi-volume work deals with several algorithmic approaches for discrete problems as well as with many combinatorial problems. The editors have brought together almost every aspect ...
Added: January 18, 2026
Branch-and-Bound and Dynamic Programming Approaches for the Knapsack Problem
Burashnikov E., Operations Research Forum 2024
Added: September 21, 2024
Exact Algorithm for Generating H-Cores in Simplified Lattice-Based Protein Model
Ignatov A., , in: 14th International Conference, OPTIMA 2023, Petrovac, Montenegro, September 18–22, 2023, Revised Selected Papers. Communications in Computer and Information Science (CCIS, volume 1913)Vol. 1913.: Springer, 2023. P. 173–187.
Modeling protein folding, which is the process by which a protein obtains its spacial shape, still remains a challenging problem. Protein geometry might be simplified by using the coarse-grained models. The highest level of simplification is achieved in HP-models where only polarity of amino acid residues is considered, and the unified monomers are located in nodes ...
Added: January 18, 2024
Mathematical Optimization Theory and Operations Research, 21st International Conference, MOTOR 2022, Petrozavodsk, Russia, July 2–6, 2022, Proceedings
Springer, 2022.
The 21 full papers presented together with 6 invited abstracts lectures and 2 tutorial abstracts in this volume were carefully reviewed and selected from 88 submissions. The conference focuses on the following topics: Mathematical programming, bi-level and global optimization, integer programming and combinatorial optimization, approximation algorithms with theoretical guarantees and approximation schemes, heuristics and meta-heuristics, ...
Added: July 7, 2022
A novel approach to subgraph selection with multiple weights on arcs
Raayatpanah M. A., Khodayifar S., Weise T. et al., Journal of Combinatorial Optimization 2022 Vol. 44 No. 1 P. 242–268
In this paper, an extension of the minimum cost flow problem is considered in which multiple incommensurate weights are associated with each arc. In the minimum cost flow problem, flow is sent over the arcs of a graph from source nodes to sink nodes. The goal is to select a subgraph with minimum associated costs ...
Added: November 16, 2021
Optimization and Applications: 12th International Conference, OPTIMA 2021, Petrovac, Montenegro, September 27 – October 1, 2021, Proceedings
Switzerland: Springer, 2021.
This book constitutes the refereed proceedings of the 12th International Conference on Optimization and Applications, OPTIMA 2021, held in Petrovac, Montenegro, in September-October 2021. The 22 full and 3 short papers presented were carefully reviewed and selected from 63 submissions. The papers are organized into the following topical sub-headings: mathematical programming, global optimization, discrete and combinatorial ...
Added: November 4, 2021
Mathematical Optimization Theory and Operations Research: 20th International Conference, MOTOR 2021, Irkutsk, Russia, July 5–10, 2021, Proceedings
Cham: Springer, 2021.
This book constitutes the proceedings of the 20th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2021, held in Irkutsk, Russia, in July 2021.  The 29 full papers and 1 short paper presented in this volume were carefully reviewed and selected from 102 submissions. Additionally, 2 full invited papers are presented in the volume. ...
Added: July 8, 2021
Mathematical Aspects of the Heap Paradox and the Hidden Parameter
Maslov V. P., Mathematical notes 2018 Vol. 103 No. 4 P. 678–680
In the paper we consider  the hidden parameter (measurement time t_meas) which  combines quantum and classical theory.   We show that  the Bose–Einstein and Fermi–Dirac quantum distributions turn out to be the decisive factor in the construction of isotherms in classical thermodynamics and in the description of the phase transition “gas to liquid” and “liquid ...
Added: December 8, 2018
Combinatorial Algorithms. 29th International Workshop, IWOCA 2018, Singapore, July 16–19, 2018. Lecture Notes in Computer Science
Springer, 2018.
This book constitutes the refereed post-conference proceedings of the 29th International Workshop on Combinatorial Algorithms, IWOCA 2018, held in Singapore, Singapore, in July 2018. The 31 regular papers presented in this volume were carefully reviewed and selected from 69 submissions. They cover diverse areas of combinatorical algorithms, complexity theory, graph theory and combinatorics, combinatorial optimization, ...
Added: October 23, 2018
A Branch and Bound Algorithm for the Cell Formation Problem
Irina Utkina, Mikhail Batsyn, , in: Models, Algorithms and Technologies for Network Analysis, Springer Proceedings in Mathematics & StatisticsVol. 156.: Switzerland: Springer, 2016. P. 115–124.
The cell formation problem (CFP) is an NP-hard optimization problem considered for cell manufacturing systems. Because of its high computational complexity several heuristics have been developed for solving this problem. In this paper we present a branch and bound algorithm which provides exact solutions of the CFP. This algorithm finds optimal solutions for 13 problems ...
Added: October 23, 2018
Optimization Problems in Graph Theory
Springer, 2018.
This book presents open optimization problems in graph theory and networks. Each chapter reflects developments in theory and applications based on Gregory Gutin’s fundamental contributions to advanced methods and techniques in combinatorial optimization.  Researchers, students, and engineers in computer science, big data, applied mathematics, operations research, algorithm design, artificial intelligence, software engineering, data analysis, industrial and ...
Added: October 10, 2018
Evaluating Typical Algorithms of Combinatorial Optimization to Solve Continuous-Time Based Scheduling Problem
Lazarev A. A., Pravdivets N., Nekrasov I., Algorithms 2018 Vol. 11 No. 4 P. 1–13
We consider one approach to formalize the Resource-Constrained Project Scheduling Problem (RCPSP) in terms of combinatorial optimization theory. The transformation of the original problem into combinatorial setting is based on interpreting each operation as an atomic entity that has a defined duration and has to be resided on the continuous time axis meeting additional restrictions. ...
Added: October 1, 2018
Computer Science – Theory and Applications: 12th International Computer Science Symposium in Russia (CSR 2017)
Luxemburg: Springer, 2017.
This book constitutes the proceedings of the 12th International Computer Science Symposium in Russia, CSR 2017, held in Kazan, Russia, in June 2017. The 22 full papers presented in this volume were carefully reviewed and selected from 44 submissions. In addition the book contains 6 invited lectures. The scope of the proposed topics is quite broad ...
Added: October 15, 2017
Competitive Intensity and Quality Maximizing Seedings in Knock-out Tournaments
Dagaev D., Suzdaltsev A., Journal of Combinatorial Optimization 2018 Vol. 35 No. 1 P. 170–188
Before a knock-out tournament starts, the participants are assigned to positions in the tournament bracket through a process known as seeding. There are many ways to seed a tournament. In this paper, we solve a discrete optimization problem of finding a seeding that maximizes spectator interest in a tournament when spectators are interested in matches ...
Added: August 1, 2017
An enhanced bitstring encoding for exact maximum clique search in sparse graphs
Pablo San Segundo ., Jorge Artieda .., Mikhail Batsyn et al., Optimization Methods and Software 2017 Vol. 32 No. 2 P. 312–335
This paper describes BBMCW, a new efficient exact maximum clique algorithm tailored for large sparse graphs which can be bit-encoded directly into memory without a heavy performance penalty. These graphs occur in real-life problems when some form of locality may be exploited to reduce their scale. One such example is correspondence graphs derived from data association ...
Added: March 9, 2017
Combinatorial Optimization and Applications - 8th International Conference, COCOA 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings
Springer, 2014.
The Eighth Annual International Conference on Combinatorial Optimization and Applications (COCOA 2014) was held during December 19–21, 2014, in Maui, Hawaii, USA. COCOA 2014 provides a forum for researchers working in the area of theoretical computer science and combinatorics. The technical program of the conference includes 56 contributed papers selected by the Program Committee from ...
Added: October 22, 2016
Сложность некоторых задач на графах с ограниченными минорами их матриц ограничений
Gribanov D., Malyshev D., Журнал Средневолжского математического общества 2016 Т. 18 № 3 С. 19–31
Мы рассматриваем естественные постановки задач о независимом множестве, о вершинном и о реберном доминирующем множестве как задач целочисленного линейного программирования и доказываем полиномиальную разрешимость этих задач для классов графов, имеющих ограниченные по абсолютному значению миноры (расширенных) матриц ограничений. ...
Added: October 20, 2016
Improved initial vertex ordering for exact maximum clique search
San Segundo P., Lopez A., Mikhail Batsyn et al., Applied Intelligence 2016 Vol. 45 No. 3 P. 868–880
This paper describes a new initial vertex ordering procedure NEW_SORT designed to enhance approximate-colour exact algorithms for the maximum clique problem (MCP). NEW_SORT considers two different vertex orderings: degree and colour-based. The degree-based vertex ordering describes an improvement over a well-known vertex ordering used by exact solvers. Moreover, colour-based vertex orderings for the MCP have ...
Added: May 27, 2016
Методы комбинаторной оптимизации. Метод ветвей и границ в решении задач химической технологии и логистики
Мешалкин В. П., Zakhodiakin G., Ходченко С. М., М.: РХТУ им. Д.И. Менделеева, 2013.
Изложены разделы теории графов и комбинаторного анализа, сущность и применение методов комбинаторной оптимизации на основе одного из широко распространенных методов комбинаторного поиска оптимальных решений – метода ветвей и границ для решения прикладных задач в химической технологии, ресурсоэнергоэффективной инженерно-технической организации сложных химико-технологических систем и логистике ресурсоэнергосбережения. Указанные задачи относятся к классу комбинаторных задач неполиномиальной сложности (NP-задач ...
Added: February 27, 2016
  • About
  • About
  • Key Figures & Facts
  • Sustainability at HSE University
  • Faculties & Departments
  • International Partnerships
  • Faculty & Staff
  • HSE Buildings
  • HSE University for Persons with Disabilities
  • Public Enquiries
  • Studies
  • Admissions
  • Programme Catalogue
  • Undergraduate
  • Graduate
  • Exchange Programmes
  • Summer University
  • Summer Schools
  • Semester in Moscow
  • Business Internship
  • Research
  • International Laboratories
  • Research Centres
  • Research Projects
  • Monitoring Studies
  • Conferences & Seminars
  • Academic Jobs
  • Yasin (April) International Academic Conference on Economic and Social Development
  • Media & Resources
  • Publications by staff
  • HSE Journals
  • Publishing House
  • iq.hse.ru: commentary by HSE experts
  • Library
  • Economic & Social Data Archive
  • Video
  • HSE Repository of Socio-Economic Information
  • HSE1993–2026
  • Contacts
  • Copyright
  • Privacy Policy
  • Site Map
Edit