Login / Signup
A first efficient algorithm for enumerating all the extreme points of a bisubmodular polyhedron.
Yasuko Matsui
Takeshi Naitoh
Ping Zhan
Published in:
CoRR (2024)
Keyphrases
</>
extreme points
convex hull
finite number
geometric properties
objective function
optimal solution
computationally efficient
search space
particle swarm optimization
matching algorithm
search algorithm
np hard
linear program
computationally intensive
infinite dimensional