An optimization method for characterizing two groups of data
From MaRDI portal
Publication:6187250
Cites work
- A Greedy Heuristic for the Set-Covering Problem
- A novel local search algorithm with configuration checking and scoring mechanism for the set k‐covering problem
- Heuristics for flights arrival scheduling at airports
- Introduction to algorithms.
- Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities
- Multicriteria Optimization
- Optimization of nearest neighbor classifiers via metaheuristic algorithms for credit risk assessment
- The complexity of theorem-proving procedures
- Two-level decomposition-based matheuristic for airline crew rostering problems with fair working time
This page was built for publication: An optimization method for characterizing two groups of data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6187250)