Anton Valentinovich Eremeev

From MaRDI portal
Person:278538

Available identifiers

zbMath Open eremeev.anton-valentinovichMaRDI QIDQ278538

List of research outcomes





PublicationDate of PublicationType
The problem of scheduling for call-centre operators2024-11-27Paper
Multi-core processor scheduling with respect to data bus bandwidth2024-04-03Paper
Finding Symmetry Groups of Some Quadratic Programming Problems2024-03-11Paper
Hybridizations of evolutionary algorithms with large neighborhood search2023-06-20Paper
Selecting a subset of diverse points based on the squared Euclidean distance2022-08-11Paper
On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths2021-05-05Paper
On solving travelling salesman problem with vertex requisitions2021-05-03Paper
Hitting times of local and global optima in genetic algorithms with very high selection pressure2021-05-03Paper
On symmetry groups of some quadratic programming problems2021-04-19Paper
On non-elitist evolutionary algorithms optimizing fitness functions with a plateau2021-04-19Paper
Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem2020-07-20Paper
Maximum diversity problem with squared Euclidean distance2020-05-19Paper
Non-convex quadratic programming problems in short wave antenna array optimization2020-05-19Paper
Lot-size scheduling of a single product on unrelated parallel machines2020-04-27Paper
Algorithms for solving the hub construction problem with given number of hub nodes2018-04-20Paper
On confidence intervals for the number of local optima2018-04-20Paper
On computational complexity of the electric power flow optimization problem in market environment2018-04-06Paper
Mixed Integer Programming Approach to Multiprocessor Job Scheduling with Setup Times2018-02-13Paper
Analysis of a multicriterial buffer capacity optimization problem for a production line2017-11-03Paper
Optimal recombination in genetic algorithms for combinatorial optimization problems. I2017-04-11Paper
Optimal recombination in genetic algorithms for combinatorial optimization problems. II2017-04-11Paper
On the complexity and approximability of some Euclidean optimal summing problems2017-01-31Paper
On the complexity of some Euclidean optimal summing problems2016-11-01Paper
On multi-product lot-sizing and scheduling with multi-machine technologies2016-05-19Paper
Polynomially solvable cases of the project scheduling problem with changing consumption and supply rates of nonaccumulative resources2016-05-02Paper
A genetic algorithm with tournament selection as a local search method2015-07-17Paper
On complexity of optimal recombination for one scheduling problem with setup times2015-07-17Paper
Reducing the Number of Changeover Constraints in a MIP Formulation of a Continuous-Time Scheduling Problem2014-08-25Paper
Complexity of buffer capacity allocation problems for production lines with unreliable machines2013-09-26Paper
Some fully polynomial time randomized approximation scheme based on an evolutionary algorithm2012-02-20Paper
The complexity of the optimal recombination for the traveling salesman problem2012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q31152812012-02-20Paper
Approximation solution of the supply management problem2012-02-10Paper
Evolutionary algorithms and dynamic programming2011-12-19Paper
Trading Hubs Construction for Electricity Markets2009-05-20Paper
Approximate solution of the control problem of supplies with many intervals and concave cost functions2009-05-07Paper
Comparing evolutionary algorithms to the (\(1+1\))-EA2009-01-15Paper
Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder2009-01-08Paper
A comparative study of some evolutionary algorithms2007-05-29Paper
Comparison of certain evolutionary algorithms2005-08-08Paper
Approximation of the supply scheduling problem2005-06-01Paper
https://portal.mardi4nfdi.de/entity/Q46674172005-04-19Paper
Statistical analysis of local search landscapes2005-04-04Paper
https://portal.mardi4nfdi.de/entity/Q44720202004-08-03Paper
https://portal.mardi4nfdi.de/entity/Q44183822003-08-10Paper
A genetic algorithm for the allocation of buffer storage capacities in a production line with unreliable machines2003-04-27Paper
https://portal.mardi4nfdi.de/entity/Q27704992002-02-13Paper
https://portal.mardi4nfdi.de/entity/Q44944142001-08-06Paper
https://portal.mardi4nfdi.de/entity/Q27220812001-07-11Paper
The set covering problem: Complexity, algorithms, experiments2001-06-10Paper
https://portal.mardi4nfdi.de/entity/Q27123002001-05-06Paper
https://portal.mardi4nfdi.de/entity/Q45172762000-11-21Paper

Research outcomes over time

This page was built for person: Anton Valentinovich Eremeev