An unconstrained quadratic binary programming approach to the vertex coloring problem
From MaRDI portal
Publication:817187
DOI10.1007/s10479-005-3449-7zbMath1091.90074OpenAlexW1987752805MaRDI QIDQ817187
Gary A. Kochenberger, Fred Glover, Bahram Alidaee, César Rego
Publication date: 7 March 2006
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-005-3449-7
Programming involving graphs or networks (90C35) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
On characterization of maximal independent sets via quadratic optimization, Applications and Computational Advances for Solving the QUBO Model, Solving the maximum edge weight clique problem via unconstrained quadratic programming, Diversification-driven tabu search for unconstrained binary quadratic problems, A hybrid metaheuristic approach to solving the UBQP problem, Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation, Fractional programming formulation for the vertex coloring problem, The unconstrained binary quadratic programming problem: a survey, Linear and quadratic programming approaches for the general graph partitioning problem, A new modeling and solution approach for the set-partitioning problem, An improved linearization strategy for zero-one quadratic programming problems, An effective modeling and solution approach for the generalized independent set problem, A new approach for modeling and solving set packing problems, Path relinking for unconstrained binary quadratic programming, A simplex like approach based on star sets for recognizing convex-\(QP\) adverse graphs, Quantum bridge analytics. I: A tutorial on formulating and using QUBO models, Quantum bridge analytics. I: A tutorial on formulating and using QUBO models, Improved row-by-row method for binary quadratic optimization problems
Uses Software
Cites Work
- Pseudo-Boolean optimization
- Probabilistic bounds and algorithms for the maximum satisfiability problem
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Simulated annealing for the unconstrained quadratic pseudo-Boolean function
- Intensification and diversification with elite tabu search solutions for the linear ordering problem
- The maximum clique problem
- A quadratic assignment formulation of the molecular conformation problem
- Minimization of a quadratic pseudo-Boolean function
- One-pass heuristics for large-scale unconstrained binary quadratic problems
- An evolutionary heuristic for quadratic 0-1 programming
- Greedy and local search heuristics for unconstrained binary quadratic programming
- A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
- Hybrid evolutionary algorithms for graph coloring
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- On the notion of balance of a signed graph
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- Methods of Nonlinear 0-1 Programming
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- Quadratic knapsack problems
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- A Column Generation Approach for Graph Coloring
- A Decomposition Method for Quadratic Zero-One Programming
- Quadratic Binary Programming with Application to Capital-Budgeting Problems
- A branch and bound algorithm for the maximum clique problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
