Exact window (doc 04 §3 F, without CP-SAT): the best placement of parts (others fixed) over a candidate set per part (its own spot, the other window parts' spots, its HPWL-optimal spot; four rotations each), by branch and bound with an HPWL bound. More...

#include <place/anneal.hpp>

Public Attributes
bool	improved = false
bool	proven = false
	proven: the search finished within max_leaves
long	nodes = 0
long	leaves = 0
std::int64_t	cost_before = 0
std::int64_t	cost_after = 0

Detailed Description

Exact window (doc 04 §3 F, without CP-SAT): the best placement of parts (others fixed) over a candidate set per part (its own spot, the other window parts' spots, its HPWL-optimal spot; four rotations each), by branch and bound with an HPWL bound.

prune = false enumerates every combination (reference path). pl is updated only when the optimum is strictly better than the start.

Definition at line 101 of file anneal.hpp.

Member Data Documentation

◆ cost_after

std::int64_t tmk::place::WindowResult::cost_after = 0

Definition at line 104 of file anneal.hpp.

◆ cost_before

std::int64_t tmk::place::WindowResult::cost_before = 0

Definition at line 104 of file anneal.hpp.

◆ improved

bool tmk::place::WindowResult::improved = false

Definition at line 102 of file anneal.hpp.

◆ leaves

long tmk::place::WindowResult::leaves = 0

Definition at line 103 of file anneal.hpp.

◆ nodes

long tmk::place::WindowResult::nodes = 0

Definition at line 103 of file anneal.hpp.

◆ proven

bool tmk::place::WindowResult::proven = false

proven: the search finished within max_leaves