Continuous quadratic programming formulations of optimization problems on graphs
From MaRDI portal
Publication:2629636
Recommendations
Cites work
- A Copositive Programming Approach to Graph Partitioning
- A cutting plane algorithm for solving bilinear programs
- A Multilevel Algorithm for the Minimum 2-sum Problem
- A Separator Theorem for Planar Graphs
- A Spectral Bundle Method for Semidefinite Programming
- An algorithm for nonlinear optimization problems with binary variables
- An Efficient Heuristic Procedure for Partitioning Graphs
- An exact algorithm for graph partitioning
- An exact algorithm for solving the vertex separator problem
- An exact penalty approach for solving a class of minimization problems with boolean variables
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Breakout local search for the quadratic assignment problem
- Checking local optimality in constrained quadratic programming is NP- hard
- Continuous Characterizations of the Maximum Clique Problem
- Copositive optimization -- recent developments and applications
- Evolution towards the maximum clique
- Exact penalty functions for nonlinear integer programming problems
- Extreme varieties, concave functions, and the fixed charge problem
- Finding good approximate vertex and edge partitions is NP-hard
- Finding independent sets in a graph using continuous multivariable polynomial formulations.
- Geometric Separators for Finite-Element Meshes
- Graph minimum linear arrangement by multilevel weighted edge contractions
- Graph Partitioning and Continuous Quadratic Programming
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3858396 (Why is no real title available?)
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 3534294 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1057697 (Why is no real title available?)
- scientific article; zbMATH DE number 3320765 (Why is no real title available?)
- scientific article; zbMATH DE number 956845 (Why is no real title available?)
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Minimalstellen von Funktionen und Extremalpunkte
- New results on the equivalence between zero-one programming and continuous concave programming
- NP-completeness of the Planar Separator Problems
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the equivalence between some discrete and continuous optimization problems
- Optimality conditions for maximizing a function over a polyhedron
- Partitioning planar graphs with vertex costs: Algorithms and applications
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Penalty formulation for zero-one nonlinear programming
- Penalty parameter for linearly constrained 0--1 quadratic programming
- Reducibility among combinatorial problems
- Some news about the independence number of a graph
- Some NP-complete problems in quadratic and nonlinear programming
- The University of Florida sparse matrix collection
- The vertex separator problem: a polyhedral investigation
- The vertex separator problem: algorithms and computations
Cited in
(12)- New inequalities for network distance measures by using graph spectra
- A hybrid breakout local search and reinforcement learning approach to the vertex separator problem
- On conjectures of network distance measures by using graph spectra
- Variable fixing method by weighted average for the continuous quadratic knapsack problem
- Knowledge discovery in graphs through vertex separation
- Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming
- Global solution of non-convex quadratically constrained quadratic programs
- Graph Partitioning and Continuous Quadratic Programming
- The bipartite QUBO
- An efficient hybrid algorithm for the separable convex quadratic knapsack problem
- The MIN-cut and vertex separator problem
- A multilevel bilinear programming algorithm for the vertex separator problem
This page was built for publication: Continuous quadratic programming formulations of optimization problems on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2629636)
