Sciweavers

113 search results - page 7 / 23
» Combinatorial Flag Varieties
Sort
View
JEA
2008
88views more  JEA 2008»
13 years 7 months ago
Multilevel algorithms for linear ordering problems
Linear ordering problems are combinatorial optimization problems which deal with the minimization of different functionals in which the graph vertices are mapped onto (1, 2, ..., ...
Ilya Safro, Dorit Ron, Achi Brandt
EOR
2007
70views more  EOR 2007»
13 years 7 months ago
Solving the maximum edge weight clique problem via unconstrained quadratic programming
The unconstrained quadratic binary program (UQP) is proving to be a successful modeling and solution framework for a variety of combinatorial optimization problems. Experience rep...
Bahram Alidaee, Fred Glover, Gary A. Kochenberger,...
ANOR
2005
72views more  ANOR 2005»
13 years 7 months ago
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem
: The vertex coloring problem has been the subject of extensive research for many years. Driven by application potential as well as computational challenge, a variety of methods ha...
Gary A. Kochenberger, Fred Glover, Bahram Alidaee,...
HEURISTICS
2002
254views more  HEURISTICS 2002»
13 years 7 months ago
A Taxonomy of Hybrid Metaheuristics
Hybrid metaheuristics have received considerable interest these recent years in the field of combinatorial optimization. A wide variety of hybrid approaches have been proposed in ...
El-Ghazali Talbi
CISS
2010
IEEE
12 years 11 months ago
Transmission coordination for ad hoc networks
— AHNs are wireless networks operating without the benefits of network infrastructure (basestations) or centralized control. AHNs working with limited spectrum perform best when...
Ananth V. Kini, Steven Weber, Fadi A. Aloul, Nagar...