The following pages link to Anton Valentinovich Eremeev (Q278538):
Displaying 50 items.
- Polynomially solvable cases of the project scheduling problem with changing consumption and supply rates of nonaccumulative resources (Q278540) (← links)
- (Q334413) (redirect page) (← links)
- On the complexity of some Euclidean optimal summing problems (Q334416) (← links)
- Complexity of buffer capacity allocation problems for production lines with unreliable machines (Q367250) (← links)
- On the complexity and approximability of some Euclidean optimal summing problems (Q506239) (← links)
- (Q591122) (redirect page) (← links)
- (Q652135) (redirect page) (← links)
- Evolutionary algorithms and dynamic programming (Q652137) (← links)
- Approximate solution of the control problem of supplies with many intervals and concave cost functions (Q1015342) (← links)
- Analysis of a multicriterial buffer capacity optimization problem for a production line (Q1675839) (← links)
- (Q1779698) (redirect page) (← links)
- Approximation of the supply scheduling problem (Q1779701) (← links)
- A genetic algorithm for the allocation of buffer storage capacities in a production line with unreliable machines (Q1868255) (← links)
- Selecting a subset of diverse points based on the squared Euclidean distance (Q2163859) (← links)
- Lot-size scheduling of a single product on unrelated parallel machines (Q2174901) (← links)
- Non-convex quadratic programming problems in short wave antenna array optimization (Q2181741) (← links)
- Maximum diversity problem with squared Euclidean distance (Q2181789) (← links)
- Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder (Q2378418) (← links)
- Comparison of certain evolutionary algorithms (Q2487726) (← links)
- Comparing evolutionary algorithms to the (\(1+1\))-EA (Q2518374) (← links)
- On symmetry groups of some quadratic programming problems (Q2663720) (← links)
- On non-elitist evolutionary algorithms optimizing fitness functions with a plateau (Q2663743) (← links)
- (Q2712300) (← links)
- The set covering problem: Complexity, algorithms, experiments (Q2713942) (← links)
- (Q2722081) (← links)
- (Q2770499) (← links)
- On Multi-product Lot-Sizing and Scheduling with Multi-machine Technologies (Q2806947) (← links)
- Optimal recombination in genetic algorithms for combinatorial optimization problems: Part I (Q2975423) (← links)
- Optimal recombination in genetic algorithms for combinatorial optimization problems: Part II (Q2975431) (← links)
- (Q3115223) (← links)
- (Q3115247) (← links)
- (Q3115281) (← links)
- (Q3115612) (← links)
- Mixed Integer Programming Approach to Multiprocessor Job Scheduling with Setup Times (Q3133223) (← links)
- Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem (Q3297452) (← links)
- On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths (Q3388417) (← links)
- A comparative study of some evolutionary algorithms (Q3439503) (← links)
- Trading Hubs Construction for Electricity Markets (Q3628640) (← links)
- (Q4418382) (← links)
- (Q4472020) (← links)
- (Q4494414) (← links)
- (Q4517276) (← links)
- (Q4636864) (← links)
- (Q4636894) (← links)
- Statistical analysis of local search landscapes (Q4661194) (← links)
- (Q4667417) (← links)
- Hitting times of local and global optima in genetic algorithms with very high selection pressure (Q4987699) (← links)
- On solving Travelling Salesman Problem with Vertex Requisitions (Q4987704) (← links)
- A genetic algorithm with tournament selection as a local search method (Q5263765) (← links)
- (Q5263771) (← links)
