Continuous quadratic programming formulations of optimization problems on graphs
From MaRDI portal
Publication:2629636
DOI10.1016/j.ejor.2014.05.042zbMath1357.90166OpenAlexW2051296280MaRDI QIDQ2629636
James T. Hungerford, William W. Hager
Publication date: 6 July 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.05.042
Programming involving graphs or networks (90C35) Quadratic programming (90C20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
New inequalities for network distance measures by using graph spectra, The Bipartite QUBO, Knowledge Discovery in Graphs Through Vertex Separation, Global solution of non-convex quadratically constrained quadratic programs, The MIN-cut and vertex separator problem, A multilevel bilinear programming algorithm for the vertex separator problem, 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, An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Copositive optimization -- recent developments and applications
- An exact algorithm for solving the vertex separator problem
- An algorithm for nonlinear optimization problems with binary variables
- Minimalstellen von Funktionen und Extremalpunkte
- New results on the equivalence between zero-one programming and continuous concave programming
- Exact penalty functions for nonlinear integer programming problems
- Penalty formulation for zero-one nonlinear programming
- Checking local optimality in constrained quadratic programming is NP- hard
- Finding good approximate vertex and edge partitions is NP-hard
- Evolution towards the maximum clique
- Penalty parameter for linearly constrained 0--1 quadratic programming
- Partitioning planar graphs with vertex costs: Algorithms and applications
- An exact algorithm for graph partitioning
- Optimality conditions for maximizing a function over a polyhedron
- Breakout local search for the quadratic assignment problem
- On the copositive representation of binary and continuous nonconvex quadratic programs
- The vertex separator problem: algorithms and computations
- The vertex separator problem: a polyhedral investigation
- On the equivalence between some discrete and continuous optimization problems
- The university of Florida sparse matrix collection
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- Some NP-complete problems in quadratic and nonlinear programming
- An exact penalty approach for solving a class of minimization problems with boolean variables
- Extreme varieties, concave functions, and the fixed charge problem
- A Separator Theorem for Planar Graphs
- An Efficient Heuristic Procedure for Partitioning Graphs
- A cutting plane algorithm for solving bilinear programs
- Continuous Characterizations of the Maximum Clique Problem
- Geometric Separators for Finite-Element Meshes
- A Spectral Bundle Method for Semidefinite Programming
- Some news about the independence number of a graph
- Graph Partitioning and Continuous Quadratic Programming
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Reducibility among Combinatorial Problems
- A Multilevel Algorithm for the Minimum 2-sum Problem
- NP-completeness of the Planar Separator Problems
- Maxima for Graphs and a New Proof of a Theorem of Turán
- A Copositive Programming Approach to Graph Partitioning
- Graph minimum linear arrangement by multilevel weighted edge contractions
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- Finding independent sets in a graph using continuous multivariable polynomial formulations.
