Pages that link to "Item:Q6043202"
From MaRDI portal
The following pages link to Different Formulations for Solving the Heaviest<i>K</i>-Subgraph Problem (Q6043202):
Displaying 15 items.
- Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster (Q342176) (← links)
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods (Q359624) (← links)
- Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners (Q778626) (← links)
- Variable neighborhood search for the heaviest \(k\)-subgraph (Q1025229) (← links)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
- Quantum solutions for densest \(k\)-subgraph problems (Q1983021) (← links)
- Exact and heuristic algorithms for the weighted total domination problem (Q2027027) (← links)
- Exact and heuristic algorithms for the maximum weighted submatrix coverage problem (Q2076862) (← links)
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- Combinatorial properties and further facets of maximum edge subgraph polytopes (Q2840727) (← links)
- On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000) (← links)
- BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints (Q5883708) (← links)
- A polyhedral study of the maximum edge subgraph problem (Q5891092) (← links)
- A polyhedral study of the maximum edge subgraph problem (Q5916096) (← links)
