613 search results - page 4 / 123 » The Model-Summary Problem and a Solution for Trees |
NETWORKS
2010
13 years 5 months ago
2010
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
CPAIOR
2007
Springer
14 years 23 days ago
2007
Springer
We show how to efficiently model binary constraint problems (BCP) as integer programs. After considering tree-structured BCPs first, we show that a Sherali-Adams-like procedure r...
SAC
2000
ACM
13 years 11 months ago
2000
ACM
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
EUROCAST
2009
Springer
14 years 1 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
ANTSW
2004
Springer
13 years 12 months ago
2004
Springer
Constructive metaheuristics explore a tree of constructive decisions, the topology of which is determined by the way solutions are represented and constructed. Some solution repres...