1723 search results - page 195 / 345 » Cycling in linear programming problems |
IPCO
2001
14 years 11 months ago
2001
We investigate network design under volatile conditions of link failures and traffic overload. Our model is a non-simultaneous 2-commodity problem. We characterize the feasible so...
WSC
2004
14 years 11 months ago
2004
Building computational models of real world systems usually requires the interaction of decision modules and simulation modules. Given different models and algorithms, the major h...
IPL
2008
14 years 9 months ago
2008
In this paper, we show how we can derive lower bounds and also compute the exact distortion for the line embeddings of some special metrics, especially trees and graphs with certai...
NETWORKS
2006
14 years 9 months ago
2006
We define binet matrices, which furnish a direct generalization of totally unimodular network matrices and arise from the node-edge incidence matrices of bidirected graphs in the ...
IPL
2000
14 years 9 months ago
2000
Given a polyhedron P by a list of inequalities we develop unbiased estimates of the number of vertices and bases of P. The estimates are based on applying tree estimation methods ...