scientific article; zbMATH DE number 978736
From MaRDI portal
Publication:4332851
Cited in
(11)- A branch-and-bound algorithm for the mini-max spanning forest problem
- CHECKCOL: improved local search for graph coloring
- Product line selection and pricing analysis: impact of genetic relaxations
- A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem
- Noising methods for a clique partitioning problem
- Flowshop scheduling research after five decades
- Global Optimization in Practice:State of the Art and Perspectives
- Model development and optimization for space engineering: concepts, tools, applications, and perspectives
- Nature-inspired metaheuristics search algorithms for solving the economic load dispatch problem of power system: a comparison study
- Greedy random adaptive memory programming search for the capacitated clustering problem
- A rough set approach to feature selection based on scatter search metaheuristic
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4332851)