Combinatorial optimization algorithms combining greedy strategies with a limited search procedure

DOI10.1134/S1064230717020137zbMath1390.90469OpenAlexW2601767467MaRDI QIDQ1745806

V. A. Kostenko

Publication date: 18 April 2018

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064230717020137

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Self-learning genetic algorithm
• Scheduling algorithms for real-time computing systems admitting simulation models
• A parallel algorithm of simulated annealing for multiprocessor scheduling
• Some algorithms for resource allocation in multiprocessor systems
• Algorithm for resource allocation in data centers with independent schedulers for different types of resources
• An algorithm for constructing single machine schedules based on ant colony approach
• Algorithm for synthesis of real-time systems under reliability constraints
• Ant algorithms: theory and applications
• Computation scheduling in multiprocessor real-time automatic control systems with constrained processor memory
• An algorithm for scheduling exchanges over a bus with centralized control and an analysis of its efficiency
• Resource allocation algorithm in data centers with a unified scheduler for different types of resources
• Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
• Preemptive Scheduling of Uniform Processor Systems

This page was built for publication: Combinatorial optimization algorithms combining greedy strategies with a limited search procedure