Sciweavers

121 search results - page 1 / 25
» Random Assignment with Integer Costs
Sort
View
CPC
2004
70views more  CPC 2004»
13 years 3 months ago
Random Assignment with Integer Costs
Robert Parviainen
GLOBECOM
2008
IEEE
13 years 10 months ago
Comparison of Routing and Wavelength Assignment Algorithms in WDM Networks
- We design and implement various algorithms for solving the static RWA problem with the objective of minimizing the maximum number of requested wavelengths based on LP relaxation ...
Kostas Christodoulopoulos, Konstantinos Manousakis...
FOSSACS
2009
Springer
13 years 10 months ago
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
Abstract. We extend discrete-timed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability...
Parosh Aziz Abdulla, Richard Mayr
OL
2011
190views Neural Networks» more  OL 2011»
12 years 10 months ago
On optimality of a polynomial algorithm for random linear multidimensional assignment problem
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
Pavlo A. Krokhmal
COR
2011
12 years 10 months ago
MIP models for connected facility location: A theoretical and computational study
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
Stefan Gollowitzer, Ivana Ljubic