An Unconstrained Binary Quadratic Programming for the Maximum Independent Set Problem

Nonlinear Analysis: Modelling and Control - Lithuania
doi 10.15388/na.17.4.14047
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Vilnius University Press

Related search

An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem

Annals of Operations Research
Management ScienceDecision SciencesOperations Research
2005English

CHN and Swap Heuristic to Solve the Maximum Independent Set Problem

International Journal of Electrical and Computer Engineering
Electronic EngineeringElectricalComputer Science
2017English

A New Heuristic Algorithm to Solve the Maximum Independent Set Problem

Mathematical and Computational Applications
2013English

An Iterative Working-Set Method for Large-Scale Nonconvex Quadratic Programming

Applied Numerical Mathematics
Computational MathematicsApplied MathematicsNumerical Analysis
2002English

Least-Norm Linear Programming Solution as an Unconstrained Minimization Problem.

1980English

Message Passing for Maximum Weight Independent Set

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
2009English

Optimized Crossover for the Independent Set Problem

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1997English

Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in H-Free Graphs

2020English

The Principal Pivoting Method for Solving Fuzzy Quadratic Programming Problem

International Journal of Pure and Applied Mathematics
MathematicsApplied Mathematics
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy