2636 search results - page 247 / 528 » Linear Programming |
118
click to vote
MP
2006
15 years 2 months ago
2006
We consider the vehicle routing problem where one can choose among vehicles with different costs and capacities to serve the trips. We develop six different formulations: the first...
NETWORKS
2006
15 years 2 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 ...
106
click to vote
IPL
2007
15 years 2 months ago
2007
Dynamic networks are characterized by transit times on edges. Dynamic flow problems consider transshipment problems in dynamic networks. We introduce a new version of dynamic fl...
130
click to vote
IPL
2000
15 years 2 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 ...
TIT
2002
15 years 2 months ago
2002
An elementary proof of a basic uncertainty principle concerning pairs of representations of vectors in different orthonormal bases is provided. The result, slightly stronger than s...