Sciweavers

16404 search results - page 463 / 3281
» A set coverage problem
Sort
View
EVOW
2008
Springer
15 years 8 months ago
Adaptive Local Search for a New Military Frequency Hopping Planning Problem
The military radio stations with frequency hopping propose new problems of frequency assignment which must take into account the size of the deployment, the limited resources and a...
Isabelle Devarenne, Alexandre Caminada, Hakim Mabe...
EUSFLAT
2007
129views Fuzzy Logic» more  EUSFLAT 2007»
15 years 8 months ago
Dealing with Incompleteness of Preferences in Group Decision Making Problems
While considering processes of decision making we often encounter the problem of incomplete information. In group decision making (GDM) problems each decision maker is supposed to...
Anna Pankowska
IPCO
2008
221views Optimization» more  IPCO 2008»
15 years 8 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
IPCO
2008
91views Optimization» more  IPCO 2008»
15 years 8 months ago
New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V....
AAAI
2004
15 years 8 months ago
The U.S. National Football League Scheduling Problem
We describe the problem of scheduling the television broadcasts of the U.S. National Football League (NFL). Unlike traditional round-robin tournament scheduling, the NFL problem i...
Bistra N. Dilkina, William S. Havens