Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

An optimization method for characterizing two groups of data

From MaRDI portal
Publication:6187250
Jump to:navigation, search

DOI10.1111/ITOR.13165MaRDI QIDQ6187250FDOQ6187250


Authors: Amir Salehipour Edit this on Wikidata


Publication date: 31 January 2024

Published in: International Transactions in Operational Research (Search for Journal in Brave)






zbMATH Keywords

optimizationfeature selectionmatheuristicsdata grouping


Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)


Cites Work

  • Introduction to algorithms.
  • A Greedy Heuristic for the Set-Covering Problem
  • Multicriteria Optimization
  • The complexity of theorem-proving procedures
  • Optimization of nearest neighbor classifiers via metaheuristic algorithms for credit risk assessment
  • Two-level decomposition-based matheuristic for airline crew rostering problems with fair working time
  • A novel local search algorithm with configuration checking and scoring mechanism for the set k‐covering problem
  • Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities
  • Heuristics for flights arrival scheduling at airports






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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6187250&oldid=35684511"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 10 July 2024, at 07:08. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki