14548 search results - page 256 / 2910 » The Optimal Path-Matching Problem |
ISCAS
2005
IEEE
15 years 8 months ago
2005
IEEE
— In this paper we provide a survey of three classes of combinatorial optimization problems that arise in communication network analysis. These problems, referred to as QoS (Qual...
151
click to vote
PDP
2002
IEEE
15 years 7 months ago
2002
IEEE
A parallel simulated annealing algorithm to solve the vehicle routing problem with time windows is presented. The objective is to find the best possible solutions to some wellkno...
113
Voted
ESA
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. The maximum flow problem is a classical optimization problem with many applications. For a long time, HI-PR, an efficient implementation of the highest-label push-relabel...
108
Voted
WINE
2010
Springer
15 years 15 days ago
2010
Springer
We study the optimal pricing strategies of a monopolist selling a divisible good (service) to consumers that are embedded in a social network. A key feature of our model is that c...
127
Voted
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We define and study two versions of the bipartite matching problem in the framework of two-stage stochastic optimization with recourse. In one version the uncertainty is...