A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem
From MaRDI portal
Publication:3386795
DOI10.1287/IJOC.2019.0898zbMATH Open1474.90494OpenAlexW3002616337WikidataQ126289413 ScholiaQ126289413MaRDI QIDQ3386795FDOQ3386795
Authors: Seyedmohammadhossein Hosseinian, Dalila B. M. M. Fontes, Sergiy Butenko 
Publication date: 7 January 2021
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2019.0898
Recommendations
- A new branch-and-bound algorithm for the maximum edge-weighted clique problem
- A Lagrangian relaxation approach to the edge-weighted clique problem
- scientific article; zbMATH DE number 26478
- A new upper bound for the maximum weight clique problem
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
- A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number
- A cutting-plane approach to the edge-weighted maximal clique problem
- ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS
- An exact algorithm for the maximum clique problem
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Integer programming (90C10)
Cites Work
- Title not available (Why is that?)
- Reducibility among combinatorial problems
- On the Shannon capacity of a graph
- Sur le coloriage des graphs
- A fast algorithm for the maximum clique problem
- Energy minimization methods in computer vision and pattern recognition. 4th international workshop, EMMCVPR 2003, Lisbon, Portugal, July 7--9, 2003. Proceedings.
- Linear degree extractors and the inapproximability of max clique and chromatic number
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Improvements to MCS algorithm for the maximum clique problem
- An exact bit-parallel algorithm for the maximum clique problem
- Approximating the maximum vertex/edge weighted clique using local search
- A review on algorithms for maximum clique problems
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- Solving the maximum edge weight clique problem via unconstrained quadratic programming
- An exact algorithm for the maximum clique problem
- Title not available (Why is that?)
- Cliques and clustering: A combinatorial approach
- New facets and a branch-and-cut algorithm for the weighted clique problem.
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
- Phased local search for the maximum clique problem
- A branch and bound algorithm for the maximum diversity problem
- Iterated tabu search for the maximum diversity problem
- A simple and faster branch-and-bound algorithm for finding a maximum clique
- Infra-chromatic bound for exact maximum clique search
- The Eigenvalues of a Graph and Its Chromatic Number
- A Lagrangian relaxation approach to the edge-weighted clique problem
- Upper Bounds on the Order of a Clique of a Graph
- Exact bounds on the order of the maximum clique of a graph.
- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
- An extended formulation approach to the edge-weighted maximal clique problem
- Hybrid heuristics for the maximum diversity problem
- Experimental and Efficient Algorithms
- A nonconvex quadratic optimization approach to the maximum edge weight clique problem
- A cutting-plane approach to the edge-weighted maximal clique problem
- A sequential elimination algorithm for computing bounds on the clique number of a graph
Cited In (7)
- Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem
- A cutting-plane approach to the edge-weighted maximal clique problem
- A new family of facet defining inequalities for the maximum edge-weighted clique problem
- A maximum edge-weight clique extraction algorithm based on branch-and-bound
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
- Exact and heuristic solution approaches for the generalized independent set problem
- A nonconvex quadratic optimization approach to the maximum edge weight clique problem
Uses Software
This page was built for publication: A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3386795)
