Now showing items 1-4 of 4
Generalized column generation for linear programming
(Institute for Operations Research and the Management Sciences (INFORMS), 2002)
Column generation is a well-known and widely practiced technique for solving linear programs with too many variables or constraints to include in the initial formulation explicitly. Instead, the required column information ...
The robust spanning tree problem with interval data
Motivated by telecommunications applications we investigate the minimum spanning tree problem where edge costs are interval numbers. Since minimum spanning trees depend on the realization of the edge costs, we de5ne the ...
A comparative study of computational procedures for the resource constrained project scheduling problem
Performance of two new integer programming based heuristics together with some special purpose algorithms for project scheduling are tested from a computational point of view. The objective of the study is to compare the ...
A branch-and-cut algorithm for two-level survivable network design problems
This paper approaches the problem of designing a two-level network protected against single-edge failures. The problem simultaneously decides on the partition of the set of nodes into terminals and hubs, the connection of ...