Now showing items 1-3 of 3
A Combinatorial Abstraction of One Shortest Path Problem and Its Relationship to Greedoids
A natural generalization of the shortest path problem to arbitrary set systems is presented that captures a number of interesting problems, including the usual graph-theoretic shortest path problem and the problem of finding ...
The Lagrangian as a Primal Cutting Plane Method for Linear Integer Programming Problems
Lagrangian relaxation and more recently cutting plane techniques have both proven to be powerful methods in the solution of integer problems. This paper explores the relationship between these techniques by interpreting ...