An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem

about

An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem

Item

http://www.wikidata.org/entity/Q57659011

description

wetenschappelijk artikel

@nl

наукова стаття, опублікована в листопаді 2016

@uk

name

An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem

@en

An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem

@nl

type

Item

label

An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem

@en

An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem

@nl

prefLabel

An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem

@en

An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem

@nl

P1476

An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem

@en

P2093

Ian-Christopher Ternier

http://www.w3.org/2001/XMLSchema#string

Virginie Gabrel

http://www.w3.org/2001/XMLSchema#string

P2860

The ellipsoid method and its consequences in combinatorial optimization

A fast algorithm for the maximum clique problem

New methods to color the vertices of a graph

A Column Generation Approach for Graph Coloring

Lower Bounding Techniques for DSATUR-based Branch and Bound

P304

124-141

http://www.w3.org/2001/XMLSchema#string

P31

scholarly article

P356

10.1002/NET.21716

http://www.w3.org/2001/XMLSchema#string

P433

http://www.w3.org/2001/XMLSchema#string

P478

http://www.w3.org/2001/XMLSchema#string

P50

Fabio Furini

P577

2016-11-08T00:00:00Z

http://www.w3.org/2001/XMLSchema#dateTime