network_oracle.hpp File Reference

Oracle for Parametric Network Problems. More...

#include <digraphx/neg_cycle.hpp>
#include <optional>
#include <type_traits>

Include dependency graph for network_oracle.hpp:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	NetworkOracle< Graph, Mapping, Fn >
	Oracle for Parametric Network Problems. More...

Concepts
concept	@1::HasKeyType

Detailed Description

Oracle for Parametric Network Problems.

This module provides an oracle implementation for solving feasibility problems in network optimization. The oracle acts as a separation oracle that can determine if a given point x is feasible with respect to the network constraints, and if not, provides a cutting plane.

The feasibility problem formulation: find x, utx s.t. utx[j] - utx[i] ≤ h(edge, x) ∀ edge(i, j) ∈ E

where h is a function that depends on the decision variables x. This is commonly used in cutting-plane methods for network optimization.

Edge weights are accessed via the actual edge data from the graph's adjacency structure (the "get_weight" method), rather than synthesized (u,v) node pairs. This matches the Python sibling implementation.