A cutting-plane approach to the edge-weighted maximal clique problem
- 27 August 1993
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 69 (1) , 121-130
- https://doi.org/10.1016/0377-2217(93)90097-7
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A cutting plane algorithm for a clustering problemMathematical Programming, 1989
- Optimization of a 532-city symmetric traveling salesman problem by branch and cutOperations Research Letters, 1987
- Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphsMathematical Methods of Operations Research, 1985
- A Cutting Plane Algorithm for the Linear Ordering ProblemOperations Research, 1984
- On the symmetric travelling salesman problem: Solution of a 120-city problemPublished by Springer Nature ,1980
- Solution of a Large-Scale Traveling-Salesman ProblemJournal of the Operations Research Society of America, 1954