Computational approaches to a combinatorial optimization problem arising from text classification

DOI10.1016/J.COR.2005.07.021zbMath1187.90231OpenAlexW2065714407MaRDI QIDQ868131

Giovanni Righini, Sandro Bosio

Publication date: 19 February 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.07.021

zbMATH Keywords

simulated annealingLagrangean relaxationthreshold accepting

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

Stochastic level-value approximation for quadratic integer convex programming

Cites Work

• Optimization by Simulated Annealing
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• Best-so-far vs. where-you-are: Implications for optimal finite-time annealing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computational approaches to a combinatorial optimization problem arising from text classification