/**
 * @file src/tableau/min-heap.ts
 * @description Priority queue for branch-and-bound node selection
 *
 * Implements a binary min-heap optimized for extracting the most
 * promising branch (lowest relaxed objective). Uses a flat array
 * for cache efficiency and LIFO tie-breaking.
 *
 * This replaces sorting the branch list on every iteration,
 * reducing complexity from O(n log n) to O(log n) per operation.
 */
import type { Branch } from "./types";
export declare class BranchMinHeap {
    private heap;
    private size;
    private seqCounter;
    private pool;
    private poolSize;
    constructor(initialCapacity?: number);
    private allocEntry;
    private freeEntry;
    get length(): number;
    isEmpty(): boolean;
    clear(): void;
    private isBefore;
    push(branch: Branch): void;
    pop(): Branch | undefined;
    peek(): Branch | undefined;
}