An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-005-3449-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987752805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 0-1 Quadratic programming approach for optimum solutions of two scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing for the unconstrained quadratic pseudo-Boolean function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of a quadratic pseudo-Boolean function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-Boolean optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic bounds and algorithms for the maximum satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intensification and diversification with elite tabu search solutions for the linear ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decomposition Method for Quadratic Zero-One Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495173 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid evolutionary algorithms for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-pass heuristics for large-scale unconstrained binary quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Memory Tabu Search for Binary Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of Nonlinear 0-1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the notion of balance of a signed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5457040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic Binary Programming with Application to Capital-Budgeting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An evolutionary heuristic for quadratic 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Column Generation Approach for Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implicit Enumeration Algorithm for Quadratic Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy and local search heuristics for unconstrained binary quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic assignment formulation of the molecular conformation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5670441 / rank
 
Normal rank

Latest revision as of 10:45, 24 June 2024

scientific article
Language Label Description Also known as
English
An unconstrained quadratic binary programming approach to the vertex coloring problem
scientific article

    Statements

    An unconstrained quadratic binary programming approach to the vertex coloring problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 March 2006
    0 references
    graph coloring
    0 references
    combinatorial optimization
    0 references
    tabu search
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers