Sciweavers

518 search results - page 11 / 104
» Beating a Random Assignment
Sort
View
IOR
2006
93views more  IOR 2006»
14 years 11 months ago
A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem
The multilevel generalized assignment problem (MGAP) is a variation of the generalized assignment problem, in which agents can execute tasks at different efficiency levels with di...
Alberto Ceselli, Giovanni Righini
EVOW
2008
Springer
15 years 1 months ago
Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem
This paper deals with the design of improved construction heuristics and iterated local search for the Routing and Wavelength Assignment problem (RWA). Given a physical network and...
Kerstin Bauer, Thomas Fischer, Sven Oliver Krumke,...
EOR
2007
147views more  EOR 2007»
14 years 11 months ago
Routing and wavelength assignment in optical networks using bin packing based algorithms
This paper addresses the problem of routing and wavelength assignment (RWA) of static lightpath requests in wavelength routed optical networks. The objective is to minimize the nu...
Nina Skorin-Kapov
CSR
2007
Springer
15 years 5 months ago
Pushing Random Walk Beyond Golden Ratio
We propose a simple modification of a well-known Random Walk algorithm for solving the Satisfiability problem and analyze its performance on random CNFs with a planted solution. ...
Ehsan Amiri, Evgeny S. Skvortsov
SODA
2003
ACM
125views Algorithms» more  SODA 2003»
15 years 1 months ago
Random MAX SAT, random MAX CUT, and their phase transitions
With random inputs, certain decision problems undergo a “phase transition”. We prove similar behavior in an optimization context. Given a conjunctive normal form (CNF) formula...
Don Coppersmith, David Gamarnik, Mohammad Taghi Ha...