Sciweavers

699 search results - page 43 / 140
» The method of combinatorial telescoping
Sort
View
ALGORITHMICA
2007
82views more  ALGORITHMICA 2007»
13 years 8 months ago
Rigid Components in Molecular Graphs
In this paper we consider 3-dimensional generic bar-and-joint realizations of squares of graphs. These graphs are also called molecular graphs due to their importance in the study...
Bill Jackson, Tibor Jordán
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 8 months ago
GRASP for the Coalition Structure Formation Problem
Abstract. The coalition structure formation problem represents an active research area in multi-agent systems. A coalition structure is defined as a partition of the agents involve...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
EOR
2010
96views more  EOR 2010»
13 years 8 months ago
The hybrid flow shop scheduling problem
The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many r...
Rubén Ruiz, José Antonio Vázq...
EOR
2007
70views more  EOR 2007»
13 years 8 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 8 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,...