1723 search results - page 79 / 345 » Cycling in linear programming problems |
133
click to vote
ENDM
2010
15 years 3 months ago
2010
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
138
click to vote
TRANSCI
2010
15 years 1 months ago
2010
We propose a new method to compute bid prices in network revenue management problems. The novel aspect of our method is that it naturally provides dynamic bid prices that depend o...
161
click to vote
CORR
1999
Springer
15 years 2 months ago
1999
Springer
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
103
click to vote
AAIM
2008
Springer
15 years 9 months ago
2008
Springer
Facility Location can be seen as a whole family of problems which have many obvious applications in economics. They have been widely explored in the Operations Research community, ...
123
click to vote
LION
2007
Springer
15 years 9 months ago
2007
Springer
The problem of finding the broadcast scheme with minimum power consumption in a wireless ad-hoc network is NP-hard. This work presents a new hybrid algorithm to solve this problem...