New Facets and a Branch-and-Cut Algorithm for the Weighted Clique Problem

Michael M. Sørensen ()
Additional contact information
Michael M. Sørensen: Department of Management Science and Logistics, Aarhus School of Business, Postal: Fuglesangs Allé 4, 8210 Aarhus V, Denmark, http://www.asb.dk/staff/bs/mim.aspx?page=%7B803EFF10-69F7-4C0F-AEE3-F7F410E4B6F2%7D

No 01-2, Working Papers from University of Aarhus, Aarhus School of Business, Department of Management Science and Logistics

Abstract: No abstract

Keywords: Mathematical analysis; Combinatorial optimization; Boolean quadratic problem; Edge-weighted clique problem; Maximum dispersion problem; Polyhedra (search for similar items in EconPapers)
Date: 2001-01-01
Note: Published in: European Journal of Operational Research, 154, 2004, pp57-70

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Access Statistics for this paper

More papers in Working Papers from University of Aarhus, Aarhus School of Business, Department of Management Science and Logistics
Address: The Aarhus School of Business, Fuglesangs Allé 4, DK-8210 Aarhus V, Denmark
Contact information at EDIRC.
Series data maintained by Helle Vinbaek Stenholt ().