Ergebnisse für: target cuts

Hier findest Du Bücher, die sich mit target cuts beschäftigen.

Contraction-based Separation and Lifting for Solving the Max-Cut Problem

Thorsten Bonato
Sievers & Partner
49.9 € · Paperback

artificial extension branch-and-cut combinatorial optimization cut polytope graph contraction lifting max-cut problem odd-cycle inequality polyhedral combinatorics projection separation target cuts unconstrained quadratic 0-1 optimization

The max-cut problem is an NP-hard combinatorial optimization problem defined on undirected weighted graphs. It consists in finding a subset of the graph's nodes such that the aggregate weight of the edges between the subset and its complement is maximized. This book deals with a new separation appro...

Array
(
    [endpoint] => /products?search=target+cuts&page=0&size=20
    [httpCode] => 200
    [curlError] => 
    [os_errno] => 0
    [primary_ip] => 144.208.215.243
    [local_ip] => 192.168.53.111
    [namelookup_time] => 0.001715
    [connect_time] => 0.019735
    [responseLength] => 2657
)