Continuous quadratic programming formulations of optimization problems on graphs (Q2629636): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Finding independent sets in a graph using continuous multivariable polynomial formulations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separator problem: a polyhedral investigation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimalstellen von Funktionen und Extremalpunkte / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breakout local search for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for solving the vertex separator problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolution towards the maximum clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositive optimization -- recent developments and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact penalty approach for solving a class of minimization problems with boolean variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding good approximate vertex and edge partitions is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the copositive representation of binary and continuous nonconvex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The university of Florida sparse matrix collection / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separator problem: algorithms and computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning planar graphs with vertex costs: Algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Minimum Weight Vertex Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness of the Planar Separator Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4110818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous Characterizations of the Maximum Clique Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions for maximizing a function over a polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Partitioning and Continuous Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some news about the independence number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Bundle Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme varieties, concave functions, and the fixed charge problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Penalty formulation for zero-one nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for solving bilinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact penalty functions for nonlinear integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Separators for Finite-Element Meshes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima for Graphs and a New Proof of a Theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for nonlinear optimization problems with binary variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-complete problems in quadratic and nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking local optimality in constrained quadratic programming is NP- hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning Sparse Matrices with Eigenvectors of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Copositive Programming Approach to Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on the equivalence between zero-one programming and continuous concave programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5599348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minimum linear arrangement by multilevel weighted edge contractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multilevel Algorithm for the Minimum 2-sum Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence between some discrete and continuous optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3326832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Penalty parameter for linearly constrained 0--1 quadratic programming / rank
 
Normal rank

Revision as of 06:22, 12 July 2024

scientific article
Language Label Description Also known as
English
Continuous quadratic programming formulations of optimization problems on graphs
scientific article

    Statements

    Continuous quadratic programming formulations of optimization problems on graphs (English)
    0 references
    0 references
    0 references
    6 July 2016
    0 references
    vertex separator
    0 references
    graph partitioning
    0 references
    maximum clique
    0 references
    continuous formulation
    0 references
    quadratic programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references