Graph Partitioning and Continuous Quadratic Programming
From MaRDI portal
Publication:4699174
Recommendations
- Linear and quadratic programming approaches for the general graph partitioning problem
- Graph partitioning using linear and semidefinite programming
- scientific article; zbMATH DE number 995811
- scientific article; zbMATH DE number 5761786
- Stochastic graph partitioning: quadratic versus SOCP formulations
- A Copositive Programming Approach to Graph Partitioning
- Semidefinite programming relaxations for the graph partitioning problem
- scientific article; zbMATH DE number 736319
- scientific article; zbMATH DE number 1182569
- Continuous quadratic programming formulations of optimization problems on graphs
Cited in
(26)- A practical method for solving large-scale TRS
- Variable fixing method by weighted average for the continuous quadratic knapsack problem
- Constrained graph partitioning via matrix differential equations
- Constructing test functions for global optimization using continuous formulations of graph problems
- Continuous graph partitioning for camera network surveillance
- Optimal allocation problem with quadratic utility functions and its relationship with graph cut problem
- Error bounds of Lanczos approach for trust-region subproblem
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Multiset graph partitioning
- Optimality conditions for maximizing a function over a polyhedron
- Lovász extension and graph cut
- Continuous quadratic programming formulations of optimization problems on graphs
- On the generalized Lanczos trust-region method
- Graph separation techniques for quadratic zero-one programming
- The convergence of the generalized Lanczos trust-region method for the trust-region subproblem
- Systematic and deterministic graph minor embedding for Cartesian products of graphs
- Discrete optimization with decision diagrams
- Two new integer linear programming formulations for the vertex bisection problem
- scientific article; zbMATH DE number 736319 (Why is no real title available?)
- Global convergence of SSM for minimizing a quadratic over a sphere
- On convergence of the generalized Lanczos trust-region method for trust-region subproblems
- A Nested Lanczos Method for the Trust-Region Subproblem
- An exact algorithm for graph partitioning
- Linear and quadratic programming approaches for the general graph partitioning problem
- Advanced coarsening schemes for graph partitioning
- An efficient hybrid algorithm for the separable convex quadratic knapsack problem
This page was built for publication: Graph Partitioning and Continuous Quadratic Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4699174)
