Skip to main content
Book Chapter

A New Tabu Search Approach to the 0–1 Equicut Problem

  • Dell’Amico M
  • Maffioli F
Springer US, (1996), 361-377
DOI: 10.1007/978-1-4613-1361-8_23
N/ACitations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

… , tabu search and a greedy randomized procedure have been developed in the last 5 years. In this paper we present a new tabu search al… In section 3 we introduce a basic tabu search …

Cite

CITATION STYLE

APA

Dell’Amico, M., & Maffioli, F. (1996). A New Tabu Search Approach to the 0–1 Equicut Problem. In Meta-Heuristics (pp. 361–377). Springer US. https://doi.org/10.1007/978-1-4613-1361-8_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free